Sciweavers

1983 search results - page 87 / 397
» Competitive graph searches
Sort
View
EUROGRAPHICS
2010
Eurographics
14 years 3 months ago
Bidirectional Search for Interactive Motion Synthesis
We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs. An optimal or near-optimal path through a motion graph often leads ...
Wan-Yen Lo and Matthias Zwicker
CNSR
2007
IEEE
181views Communications» more  CNSR 2007»
13 years 11 months ago
The Application of Users' Collective Experience for Crafting Suitable Search Engine Query Recommendations
Search engines have turned into one of the most important services of the Web that are frequently visited by any user. They assist their users in finding appropriate information. ...
Faezeh Ensan, Ebrahim Bagheri, Mohsen Kahani
CPAIOR
2004
Springer
14 years 1 months ago
Scheduling Abstractions for Local Search
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...
Pascal Van Hentenryck, Laurent Michel
JMLR
2010
113views more  JMLR 2010»
13 years 2 months ago
Optimal Search on Clustered Structural Constraint for Learning Bayesian Network Structure
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
Kaname Kojima, Eric Perrier, Seiya Imoto, Satoru M...
JCO
2007
130views more  JCO 2007»
13 years 7 months ago
On edge orienting methods for graph coloring
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
Bernard Gendron, Alain Hertz, Patrick St-Louis