Sciweavers

2917 search results - page 54 / 584
» Satisfying Interaction Constraints
Sort
View
DBPL
2007
Springer
103views Database» more  DBPL 2007»
14 years 22 days ago
Datalog Programs over Infinite Databases, Revisited
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
Sara Cohen, Joseph Gil, Evelina Zarivach
GRAPHITE
2005
ACM
14 years 2 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 ...
JSSPP
1995
Springer
14 years 10 days ago
The Interaction between Memory Allocation and Adaptive Partitioning in Message-Passing Multicomputers
Abstract. Most studies on adaptive partitioning policies for scheduling parallel jobs on distributed memory parallel computers ignore the constraints imposed by the memory requirem...
Sanjeev Setia
ICALP
2009
Springer
14 years 3 months ago
A Better Algorithm for Random k-SAT
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high p...
Amin Coja-Oghlan
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 9 months ago
Modular difference logic is hard
In connection with machine arithmetic, we are interested in systems of constraints of the form x + k y + k . Over integers, the satisfiability problem for such systems is polynomi...
Nikolaj Bjørner, Andreas Blass, Yuri Gurevi...