Sciweavers

1187 search results - page 127 / 238
» Graph-Based Procedural Abstraction
Sort
View
106
Voted
ICCSA
2004
Springer
15 years 7 months ago
A Reduced Codification for the Logical Representation of Job Shop Scheduling Problems
Abstract. This paper presents the Job Shop Scheduling Problem (JSSP) represented as the well known Satisfiabilty Problem (SAT). Even though the representation of JSSP in SAT is not...
Juan Frausto Solís, Marco Antonio Cruz-Chav...
IFIP
2004
Springer
15 years 7 months ago
Efficient Algorithms for Handling Molecular Weighted Sequences
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
ISMS
2004
Springer
15 years 7 months ago
Real-Time Incision Simulation Using Discontinuous Free Form Deformation
Abstract. Surgical simulations with the aid of computers is a topic of increasingly extensive research. Realtime response and interactivity are crucial components of any such syste...
Guy Sela, Sagi Schein, Gershon Elber
107
Voted
SAMOS
2004
Springer
15 years 7 months ago
Constraints Derivation and Propagation for Large-Scale Embedded Systems Exploration
Abstract— The translation of user requirements to system constraints and parameters during an exploration exercise is a hard problem, especially in the context of large scale emb...
Laurentiu Nicolae, Ed F. Deprettere
SAT
2004
Springer
115views Hardware» more  SAT 2004»
15 years 7 months ago
Full CNF Encoding: The Counting Constraints Case
Abstract. Many problems are naturally expressed using CNF clauses and boolean cardinality constraints. It is generally believed that solving such problems through pure CNF encoding...
Olivier Bailleux, Yacine Boufkhad