Sciweavers

1453 search results - page 262 / 291
» Partial Constraint Satisfaction
Sort
View
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
15 years 1 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
ATVA
2006
Springer
131views Hardware» more  ATVA 2006»
15 years 1 months ago
Timed Unfoldings for Networks of Timed Automata
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynie...
CHI
2006
ACM
15 years 1 months ago
Representation of interwoven surfaces in 2 1/2 D drawing
The state-of-the-art in computer drawing programs is based on a number of concepts that are over two decades old. One such concept is the use of layers for ordering the surfaces i...
Keith Wiley, Lance R. Williams
EELC
2006
124views Languages» more  EELC 2006»
15 years 1 months ago
How Grammar Emerges to Dampen Combinatorial Search in Parsing
Abstract. According to the functional approach to language evolution (inspired by cognitive linguistics and construction grammar), grammar arises to deal with issues in communicati...
Luc Steels, Pieter Wellens
FMCAD
2006
Springer
15 years 1 months ago
Finite Instantiations for Integer Difference Logic
The last few years have seen the advent of a new breed of decision procedures for various fragments of first-order logic based on ional abstraction. A lazy satisfiability checker ...
Hyondeuk Kim, Fabio Somenzi