Sciweavers

6036 search results - page 1081 / 1208
» Web search solved
Sort
View
132
Voted
AAMAS
2000
Springer
15 years 4 months ago
Algorithms for Distributed Constraint Satisfaction: A Review
When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distrib...
Makoto Yokoo, Katsutoshi Hirayama
CORR
2002
Springer
111views Education» more  CORR 2002»
15 years 4 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
ENTCS
2002
148views more  ENTCS 2002»
15 years 4 months ago
A Declarative Debugging System for Lazy Functional Logic Programs
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
Rafael Caballero, Mario Rodríguez-Artalejo
157
Voted
IVC
2002
132views more  IVC 2002»
15 years 4 months ago
Structure and motion estimation from apparent contours under circular motion
In this paper we address the problem of recovering structure and motion from the apparent contours of a smooth surface. Fixed image features under circular motion and their relati...
Kwan-Yee Kenneth Wong, Paulo R. S. Mendonça...
TIP
1998
129views more  TIP 1998»
15 years 4 months ago
Minimax partial distortion competitive learning for optimal codebook design
— The design of the optimal codebook for a given codebook size and input source is a challenging puzzle that remains to be solved. The key problem in optimal codebook design is h...
Ce Zhu, Lai-Man Po
« Prev « First page 1081 / 1208 Last » Next »