Sciweavers

4117 search results - page 112 / 824
» On the Satisfiability of Complex Constraints
Sort
View
AOSD
2011
ACM
15 years 1 months ago
Experiences documenting and preserving software constraints using aspects
Software systems are increasingly being built as compositions of reusable artifacts (components, frameworks, toolkits, plug-ins, APIs, etc) that have non-trivial usage constraints...
Roberto Silveira Silva Filho, François Bron...
GRAPHITE
2005
ACM
15 years 12 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 ...
CORR
2011
Springer
159views Education» more  CORR 2011»
15 years 1 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
AIPS
2003
15 years 7 months ago
SOFIA's Choice: Scheduling Observations for an Airborne Observatory
We describe the problem of scheduling observations for an airborne astronomical observatory. The problem incorporates complex constraints relating the feasibility of an astronomic...
Jeremy Frank, Elif Kürklü
DLOG
2006
15 years 7 months ago
PSPACE Automata for Description Logics
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...
Jan Hladik, Rafael Peñaloza