scispace - formally typeset
Search or ask a question
Author

Yaniv Altshuler

Bio: Yaniv Altshuler is an academic researcher from Massachusetts Institute of Technology. The author has contributed to research in topics: Swarm behaviour & Social trading. The author has an hindex of 24, co-authored 78 publications receiving 1608 citations. Previous affiliations of Yaniv Altshuler include University of Haifa & Deutsche Telekom.


Papers
More filters
Journal ArticleDOI
TL;DR: This work analyzes the problem of many simple robots cooperating to clean the dirty floor of a non-convex region in Z 2, using the dirt on the floor as the main means of inter-robot communication.
Abstract: In the world of living creatures, simple-minded animals often cooperate to achieve common goals with amazing performance. One can consider this idea in the context of robotics, and suggest models for programming goal-oriented behavior into the members of a group of simple robots lacking global supervision. This can be done by controlling the local interactions between the robot agents, to have them jointly carry out a given mission. As a test case we analyze the problem of many simple robots cooperating to clean the dirty floor of a non-convex region in Z2, using the dirt on the floor as the main means of inter-robot communication.

145 citations

Journal ArticleDOI
TL;DR: A new traffic assignment model is suggested that is based on the concept of shortest path betweenness centrality measure, borrowed from the domain of complex network analysis, and it is shown how betweenness can be augmented in order to solve the traffic assignment problem given an arbitrary travel cost definition.

94 citations

Journal ArticleDOI
TL;DR: By applying constraint programming, a subfield of artificial intelligence, this paper is able to deal successfully with the complex constraints encountered in the field and reach near-optimal assignments that take into account all resources and positions in the pool.
Abstract: Matching highly skilled people to available positions is a high-stakes task that requires careful consideration by experienced resource managers. A wrong decision may result in significant loss of value due to understaffing, underqualification or overqualification of assigned personnel, and high turnover of poorly matched workers. While the importance of quality matching is clear, dealing with pools of hundreds of jobs and resources in a dynamic market generates a significant amount of pressure to make decisions rapidly. We present a novel solution designed to bridge the gap between the need for high-quality matches and the need for timeliness. By applying constraint programming, a subfield of artificial intelligence, we are able to deal successfully with the complex constraints encountered in the field and reach near-optimal assignments that take into account all resources and positions in the pool. The considerations include constraints on job role, skill level, geographical location, language, potential retraining, and many more. Constraints are applied at both the individual and team levels. This paper introduces the technology and then describes its use by IBM Global Services, where large numbers of service and consulting employees are considered when forming teams assigned to customer projects.

91 citations

Journal ArticleDOI
01 Jul 2008-Robotica
TL;DR: This work examines the Cooperative Hunters problem, where a swarm of unmanned air vehicles is used for searching one or more “evading targets,” which are moving in a predefined area while trying to avoid a detection by the swarm.
Abstract: This work examines the Cooperative Hunters problem, where a swarm of unmanned air vehicles (UAVs) is used for searching one or more “evading targets,” which are moving in a predefined area while trying to avoid a detection by the swarm. By arranging themselves into efficient geometric flight configurations, the UAVs optimize their integrated sensing capabilities, enabling the search of a maximal territory.

86 citations

Journal ArticleDOI
TL;DR: The Linear Code is a new syntax for representing glycoconjugates and their associated molecules in a simple linear fashion that enables the implementation of bioinformatics tools for investigation and analysis of glyco-molecules and their biology.
Abstract: The Linear Code is a new syntax for representing glycoconjugates and their associated molecules in a simple linear fashion. Similar to the straightforward single letter nomenclature of DNA and proteins, Linear Code presents glycoconjugates in a canonic, compact and practical form while accounting for all relevant stereochemical and structural configurations. It uses a single letter code to represent each monosaccharide and includes a condensed description of the connections between monosaccharides and their modifications, allowing a simple linear representation of these compounds. The new linear syntax enables the implementation of bioinformatics tools for investigation and analysis of glyco-molecules and their biology.

86 citations


Cited by
More filters
Journal ArticleDOI

[...]

08 Dec 2001-BMJ
TL;DR: There is, I think, something ethereal about i —the square root of minus one, which seems an odd beast at that time—an intruder hovering on the edge of reality.
Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

33,785 citations

Proceedings ArticleDOI
22 Jan 2006
TL;DR: Some of the major results in random graphs and some of the more challenging open problems are reviewed, including those related to the WWW.
Abstract: We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

7,116 citations

Journal ArticleDOI
TL;DR: A review of the most successful CPP methods, focusing on the achievements made in the past decade, is presented, providing links to the most interesting and successful works.

1,157 citations

01 Jan 2013

1,098 citations

Journal ArticleDOI
TL;DR: GlycoWorkbench is a software tool developed by the EUROCarbDB initiative to assist the manual interpretation of MS data to evaluate a set of structures proposed by the user by matching the corresponding theoretical list of fragment masses against the list of peaks derived from the spectrum.
Abstract: Mass spectrometry is the main analytical technique currently used to address the challenges of glycomics as it offers unrivalled levels of sensitivity and the ability to handle complex mixtures of different glycan variations. Determination of glycan structures from analysis of MS data is a major bottleneck in high-throughput glycomics projects, and robust solutions to this problem are of critical importance. However, all the approaches currently available have inherent restrictions to the type of glycans they can identify, and none of them have proved to be a definitive tool for glycomics. GlycoWorkbench is a software tool developed by the EUROCarbDB initiative to assist the manual interpretation of MS data. The main task of GlycoWorkbench is to evaluate a set of structures proposed by the user by matching the corresponding theoretical list of fragment masses against the list of peaks derived from the spectrum. The tool provides an easy to use graphical interface, a comprehensive and increasing set of str...

900 citations