Sciweavers

3267 search results - page 289 / 654
» Generalized quasirandom graphs
Sort
View
LPNMR
2005
Springer
16 years 9 days ago
Loops: Relevant or Redundant?
Loops and the corresponding loop formulas play an important role in answer set programming. On the one hand, they are used for guaranteeing correctness and completeness in SAT-base...
Martin Gebser, Torsten Schaub
WG
2005
Springer
16 years 9 days ago
Algebraic Operations on PQ Trees and Modular Decomposition Trees
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
Ross M. McConnell, Fabien de Montgolfier
CPAIOR
2004
Springer
16 years 7 days ago
Cost Evaluation of Soft Global Constraints
This paper shows that existing definitions of costs associated with soft global constraints are not sufficient to deal with all the usual global constraints. We propose more expre...
Nicolas Beldiceanu, Thierry Petit
INFOCOM
2003
IEEE
16 years 3 days ago
Big-Bang Simulation for embedding network distances in Euclidean space
— Embedding of a graph metric in Euclidean space efficiently and accurately is an important problem in general with applications in topology aggregation, closest mirror selectio...
Yuval Shavitt, Tomer Tankel
DATE
2010
IEEE
135views Hardware» more  DATE 2010»
15 years 12 months ago
Mapping scientific applications on a large-scale data-path accelerator implemented by single-flux quantum (SFQ) circuits
— To overcome issues originating from the CMOS technology, a large-scale reconfigurable data-path (LSRDP) processor based on single-flux quantum circuits is introduced. LSRDP is ...
Farhad Mehdipour, Hiroaki Honda, Hiroshi Kataoka, ...