Sciweavers

14386 search results - page 2504 / 2878
» The Chinese Generals Problem
Sort
View
SODA
1992
ACM
140views Algorithms» more  SODA 1992»
15 years 8 months ago
Separation and Approximation of Polyhedral Objects
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
Joseph S. B. Mitchell, Subhash Suri
APCCM
2009
15 years 7 months ago
Conceptual Application Domain Modelling
Application domain description precedes requirements engineering, and is the basis for the development of a software or information system that satisfies all expectations of its u...
Bernhard Thalheim, Klaus-Dieter Schewe, Hui Ma
ATAL
2009
Springer
15 years 7 months ago
Efficient physics-based planning: sampling search via non-deterministic tactics and skills
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
Stefan Zickler, Manuela M. Veloso
ATAL
2010
Springer
15 years 7 months ago
Enumeration and exact design of weighted voting games
In many multiagent settings, situations arise in which agents must collectively make decisions while not every agent is supposed to have an equal amount of influence in the outcom...
Bart de Keijzer, Tomas Klos, Yingqian Zhang
CLEF
2010
Springer
15 years 7 months ago
The Robot Vision Track at ImageCLEF 2010
This paper describes the robot vision track that has been proposed to the ImageCLEF 2010 participants. The track addressed the problem of visual place classification, with a specia...
Andrzej Pronobis, Marco Fornoni, Henrik I. Christe...
« Prev « First page 2504 / 2878 Last » Next »