Sciweavers

5316 search results - page 319 / 1064
» Which Search Problems Are Random
Sort
View
JSAC
2008
140views more  JSAC 2008»
15 years 7 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
TROB
2010
127views more  TROB 2010»
15 years 5 months ago
Motion Planning With Dynamics by a Synergistic Combination of Layers of Planning
—To efficiently solve challenging motion-planning problems with dynamics, this paper proposes treating motion planning not just as a search problem in a continuous space but as ...
Erion Plaku, Lydia E. Kavraki, Moshe Y. Vardi
ICIP
2000
IEEE
16 years 8 months ago
Fast Code Enhancement with Local Search for Fractal Image Compression
Optimal fractal coding consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Optimal fractal coding is ...
Raouf Hamzaoui, Dietmar Saupe, Michael Hiller
IAT
2006
IEEE
16 years 1 months ago
Resolution-Based Policy Search for Imperfect Information Differential Games
Differential games (DGs), considered as a typical model of game with continuous states and non-linear dynamics, play an important role in control and optimization. Finding optimal...
Minh Nguyen-Duc, Brahim Chaib-draa
WEBDB
2010
Springer
167views Database» more  WEBDB 2010»
16 years 2 days ago
Tree patterns with Full Text Search
Tree patterns with full text search form the core of both XQuery Full Text and the NEXI query language. On such queries, users expect a relevance-ranked list of XML elements as an...
Maria-Hendrike Peetz, Maarten Marx