Sciweavers

4117 search results - page 669 / 824
» On the Satisfiability of Complex Constraints
Sort
View
ICRA
2006
IEEE
99views Robotics» more  ICRA 2006»
16 years 18 days ago
MRSAM: a Quadratically Competitive Multi-robot Online Navigation Algorithm
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
Shahar Sarid, Amir Shapiro, Yoav Gabriely
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
16 years 17 days ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
PLDI
2006
ACM
16 years 16 days ago
Context-sensitive domain-independent algorithm composition and selection
Progressing beyond the productivity of present-day languages appears to require using domain-specific knowledge. Domain-specific languages and libraries (DSLs) proliferate, but ...
Troy A. Johnson, Rudolf Eigenmann
GROUP
2005
ACM
16 years 4 days ago
An optimization approach to group coupling in heterogeneous collaborative systems
Recent proliferation of computing devices has brought attention to heterogeneous collaborative systems, where key challenges arise from the resource limitations and disparities. S...
Carlos D. Correa, Ivan Marsic
ESOP
2005
Springer
16 years 3 days ago
Programming with Explicit Security Policies
Are computing systems trustworthy? To answer this, we need to know three things: what the systems are supposed to do, what they are not supposed to do, and what they actually do. A...
Andrew C. Myers