Sciweavers

7195 search results - page 761 / 1439
» On Computing Power
Sort
View
LICS
2010
IEEE
15 years 5 months ago
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
Manuel Bodirsky, Martin Hils, Barnaby Martin
185
Voted
ICRA
2000
IEEE
123views Robotics» more  ICRA 2000»
15 years 12 months ago
Design, Modeling and Preliminary Control of a Compliant Hexapod Robot
In this paper, we present the design, modeling and preliminary control of RHex, an autonomous dynamically stable hexapod possessing merely six actuated degrees of freedom (at the ...
Uluc Saranli, Martin Buehler, Daniel E. Koditschek
DIALM
1999
ACM
113views Algorithms» more  DIALM 1999»
15 years 11 months ago
Flooding for reliable multicast in multi-hop ad hoc networks
Ad hoc networks are gaining popularity as a result of advances in smaller, more versatile and powerful mobile computing devices. The distinguishing feature of these networks is the...
Christopher Ho, Katia Obraczka, Gene Tsudik, Kumar...
GECCO
2010
Springer
180views Optimization» more  GECCO 2010»
15 years 9 months ago
Coevolution of heterogeneous multi-robot teams
Evolving multiple robots so that each robot acting independently can contribute to the maximization of a system level objective presents significant scientific challenges. For e...
Matt Knudson, Kagan Tumer
AAAI
1998
15 years 8 months ago
A Non-Deterministic Semantics for Tractable Inference
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
James M. Crawford, David W. Etherington