2925 search results - page 29 / 585 » Information Complexity of Online Problems |
109
Voted
LATIN
2000
Springer
15 years 5 months ago
2000
Springer
In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter of the algorithm has its extreme value
111
click to vote
ICTAI
2008
IEEE
15 years 8 months ago
2008
IEEE
The Web Service Composition (WSC) problem on behavioral descriptions deals with the automatic construction of a coordinator web service to control a set of web services to reach t...
107
click to vote
JAIR
2008
15 years 1 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
127
click to vote
DRR
2008
15 years 3 months ago
2008
Line segmentation is the first and the most critical pre-processing step for a document recognition/analysis task. Complex handwritten documents with lines running into each other...
102
click to vote
ICRA
2000
IEEE
15 years 6 months ago
2000
IEEE
Mobile robots require the ability to build their own maps to operate in unknown environments. A fundamental problem is that odometry-based dead reckoning cannot be used to assign ...