Sciweavers

7557 search results - page 447 / 1512
» Constraints as a design pattern
Sort
View
ATAL
2009
Springer
16 years 1 months ago
On the complexity of schedule control problems for knockout tournaments
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
Thuc Vu, Alon Altman, Yoav Shoham
VLSID
2002
IEEE
177views VLSI» more  VLSID 2002»
16 years 7 months ago
RTL-Datapath Verification using Integer Linear Programming
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
Raik Brinkmann, Rolf Drechsler
CP
2000
Springer
15 years 11 months ago
Extending Forward Checking
Abstract. Among backtracking based algorithms for constraint satisfaction problems (CSPs), algorithms employing constraint propagation, like forward checking (FC) and MAC, have had...
Fahiem Bacchus
SMA
2008
ACM
286views Solid Modeling» more  SMA 2008»
15 years 7 months ago
Controlled field generation for quad-remeshing
Quadrangular remeshing of triangulated surfaces has received an increasing attention in recent years. A particularly elegant approach is the extraction of quads from the streamlin...
Oliver Schall, Rhaleb Zayer, Hans-Peter Seidel
DATE
2003
IEEE
124views Hardware» more  DATE 2003»
16 years 10 days ago
A Custom-Cell Identification Method for High-Performance Mixed Standard/Custom-Cell Designs
: Over the years, many design methodologies/tools and layout architectures have been developed for datapath-oriented designs. One commonly used approach for high-speed datapath des...
Jennifer Y.-L. Lo, Wu-An Kuo, Allen C.-H. Wu, Ting...