Sciweavers

1795 search results - page 345 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
14 years 3 months 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
14 years 3 months 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
GRAPHITE
2005
ACM
14 years 3 months ago
3D screen-space widgets for non-linear projection
Linear perspective is a good approximation to the format in which the human visual system conveys 3D scene information to the brain. Artists expressing 3D scenes, however, create ...
Patrick Coleman, Karan Singh, Leon Barrett, Nisha ...
GROUP
2005
ACM
14 years 3 months 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
14 years 3 months 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