Sciweavers

4218 search results - page 521 / 844
» Complete sets of cooperations
Sort
View
TSP
2008
151views more  TSP 2008»
15 years 4 months ago
Convergence Analysis of Reweighted Sum-Product Algorithms
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
Tanya Roosta, Martin J. Wainwright, Shankar S. Sas...
JUCS
2007
108views more  JUCS 2007»
15 years 4 months ago
On Pipelining Sequences of Data-Dependent Loops
: Sequences of data-dependent tasks, each one traversing large data sets, exist in many applications (such as video, image and signal processing applications). Those tasks usually ...
Rui Rodrigues, João M. P. Cardoso
LISP
2007
112views more  LISP 2007»
15 years 4 months ago
Axioms for control operators in the CPS hierarchy
A CPS translation is a syntactic translation of programs, which is useful for describing their operational behavior. By iterating the standard callby-value CPS translation, Danvy a...
Yukiyoshi Kameyama
ALGORITHMICA
2002
84views more  ALGORITHMICA 2002»
15 years 4 months ago
Exploring Unknown Environments with Obstacles
We study exploration problems where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the rst problem setting we cons...
Susanne Albers, Klaus Kursawe, Sven Schuierer
CI
2004
116views more  CI 2004»
15 years 4 months ago
Solution Generation with Qualitative Models of Preferences
We consider automated decision aids that help users select the best solution from a large set of options. For such tools to successfully accomplish their task, eliciting and repre...
Boi Faltings, Marc Torrens, Pearl Pu