Sciweavers

338 search results - page 22 / 68
» Approximation Spaces and Information Granulation
Sort
View
ICRA
2005
IEEE
135views Robotics» more  ICRA 2005»
15 years 3 months ago
Sampling-Based Motion Planning Using Predictive Models
— Robotic motion planning requires configuration space exploration. In high-dimensional configuration spaces, a complete exploration is computationally intractable. Practical m...
Brendan Burns, Oliver Brock
JACM
2007
160views more  JACM 2007»
14 years 9 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
80
Voted
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
15 years 3 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm
UPP
2004
Springer
15 years 2 months ago
From Prescriptive Programming of Solid-State Devices to Orchestrated Self-organisation of Informed Matter
Abstract. Achieving real-time response to complex, ambiguous, highbandwidth data is impractical with conventional programming. Only the narrow class of compressible input-output ma...
Klaus-Peter Zauner
CP
2005
Springer
15 years 3 months ago
Using Constraint Programming for Solving Distance CSP with Uncertainty
Many problems in chemistry, robotics or molecular biology can be expressed as a Distance CSP4 . In this paper, we propose a specific methodology for tackling uncertainties in this...
Carlos Grandón, Bertrand Neveu