Sciweavers

8437 search results - page 238 / 1688
» Preferences over Sets
Sort
View
JCST
2010
155views more  JCST 2010»
15 years 1 months ago
Efficient Location Updates for Continuous Queries over Moving Objects
Abstract The significant overhead related to frequent location updates from moving objects often results in poor performance. As most of the location updates do not affect the quer...
Yu-Ling Hsueh, Roger Zimmermann, Wei-Shinn Ku
IWEC
2008
15 years 8 months ago
Strategic Path Planning on the Basis of Risk vs. Time
Abstract. The selection of path in an urban combat setting determines the survival to a greater extent. In this paper we propose an algorithm that finds strategic paths inside a ma...
Ashish C. Singh, Lawrence B. Holder
ICALP
2009
Springer
16 years 1 months ago
Popular Mixed Matchings
We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly inv...
Telikepalli Kavitha, Julián Mestre, Meghana...
HRI
2007
ACM
15 years 10 months ago
Robotic etiquette: results from user studies involving a fetch and carry task
This paper presents results, outcomes and conclusions from a series of Human Robot Interaction (HRI) trials which investigated how a robot should approach a human in a fetch and c...
Michael L. Walters, Kerstin Dautenhahn, Sarah N. W...
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
15 years 6 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...