Sciweavers

4488 search results - page 305 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
SARA
2007
Springer
15 years 11 months ago
Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
Ugur Kuter, Jiaqiao Hu
MVA
1998
230views Computer Vision» more  MVA 1998»
15 years 6 months ago
An Efficient Matching Algorithm for Segment-Based Stereo Vision Using Dynamic Programming Technique
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
Toshio Ueshiba, Yoshihiro Kawai, Yasushi Sumi, Fum...
FOCS
2006
IEEE
15 years 10 months ago
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
Xiaoming Sun, Andrew Chi-Chih Yao
CEC
2005
IEEE
15 years 10 months ago
Evolving binary decision diagrams using implicit neutrality
Abstract- A new algorithm is presented for evolving Binary Decision Diagrams (BDD) that employs the neutrality implicit in the BDD representation. It is shown that an effortless ne...
Richard M. Downing
HICSS
2005
IEEE
91views Biometrics» more  HICSS 2005»
15 years 10 months ago
Size Does Matter in Computer Collaboration: Heterogeneous Platform Effects on Human-Human Interaction
Because today’s workforce is highly mobile, small wireless devices are being used to support mobile work collaboration. However, do computer platform differences affect such col...
Marilyn Tremaine, Aleksandra Sarcevic, Dezhi Wu, M...