Sciweavers

9210 search results - page 1803 / 1842
» Analyzing Real-Time Systems
Sort
View
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
13 years 10 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...
AAAI
1996
13 years 10 months ago
What Is Planning in the Presence of Sensing?
The Airport Example The Omelette Example Copyright c 1996 American Association for Artificial Intelligence. All rights reserved. Despite the existence of programs that are able to ...
Hector J. Levesque
NIPS
1996
13 years 10 months ago
Neural Models for Part-Whole Hierarchies
We present a connectionist method for representing images that explicitlyaddresses their hierarchicalnature. It blends data fromneuroscience about whole-object viewpoint sensitive...
Maximilian Riesenhuber, Peter Dayan
ATAL
2010
Springer
13 years 10 months ago
Deception in networks of mobile sensing agents
Recent studies have investigated how a team of mobile sensors can cope with real world constraints, such as uncertainty in the reward functions, dynamically appearing and disappea...
Viliam Lisý, Roie Zivan, Katia P. Sycara, M...
ATAL
2010
Springer
13 years 10 months ago
Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms
This paper analyzes the worst-case efficiency ratio of falsename-proof combinatorial auction mechanisms. False-nameproofness generalizes strategy-proofness by assuming that a bidd...
Atsushi Iwasaki, Vincent Conitzer, Yoshifusa Omori...
« Prev « First page 1803 / 1842 Last » Next »