Sciweavers

4451 search results - page 46 / 891
» On Random Ordering Constraints
Sort
View
CONSTRAINTS
2010
116views more  CONSTRAINTS 2010»
14 years 9 months ago
Enabling local computation for partially ordered preferences
Abstract. Many computational problems linked to uncertainty and preference management can be expressed in terms of computing the marginal(s) of a combination of a collection of val...
Hélène Fargier, Emma Rollon, Nic Wil...
IJRR
2002
106views more  IJRR 2002»
14 years 11 months ago
Randomized Kinodynamic Motion Planning with Moving Obstacles
This paper presents a novel randomized motion planner for robots that must achieve a specified goal under kinematic and/or dynamic motion constraints while avoiding collision with...
David Hsu, Robert Kindel, Jean-Claude Latombe, Ste...
IJCV
2008
157views more  IJCV 2008»
14 years 11 months ago
A General Method for Sensor Planning in Multi-Sensor Systems: Extension to Random Occlusion
Systems utilizing multiple sensors are required in many domains. In this paper, we specifically concern ourselves with applications where dynamic objects appear randomly and the s...
Anurag Mittal, Larry S. Davis
ICDT
2005
ACM
128views Database» more  ICDT 2005»
15 years 5 months ago
First-Order Query Rewriting for Inconsistent Databases
We consider the problem of retrieving consistent answers over databases that might be inconsistent with respect to some given integrity constraints. In particular, we concentrate o...
Ariel Fuxman, Renée J. Miller
CORR
2011
Springer
194views Education» more  CORR 2011»
14 years 6 months ago
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
Paul N. Balister, Béla Bollobás, Ani...