5316 search results - page 265 / 1064 » Which Search Problems Are Random |
138
click to vote
COLING
2000
15 years 6 months ago
2000
In this paper, we describe a search procedure for statistical machine translation (MT) based on dynmnic programming (DP). Starting from a DP-based solution to the traveling salesm...
113
click to vote
ICCD
2001
IEEE
16 years 1 months ago
2001
IEEE
Reduced Ordered Binary Decision Diagrams (BDDs) are a data structure for representation and manipulation of Boolean functions which are frequently used in VLSI Design Automation. ...
165
click to vote
IROS
2007
IEEE
15 years 11 months ago
2007
IEEE
— This paper presents an object active visual search behavior in a 3D environment performed by a HRP-2 humanoid robot. The search is formalized as an optimization problem in whic...
128
click to vote
CP
2007
Springer
15 years 11 months ago
2007
Springer
Constraints have played a central role in cp because they capture key substructures of a problem and efficiently exploit them to boost inference. This paper intends to do the same ...
142
click to vote
ICDCS
2005
IEEE
15 years 10 months ago
2005
IEEE
Existing techniques for keyword/attribute search in structured P2P overlays suffer from several problems: unbalanced load, hot spots, fault tolerance, storage redundancy, and unab...