Sciweavers

2218 search results - page 164 / 444
» Testing Expressibility Is Hard
Sort
View
FPL
1999
Springer
103views Hardware» more  FPL 1999»
14 years 1 months ago
IP Validation for FPGAs Using Hardware Object Technology
Although verification and simulation tools are always improving, the results they provide remain hard to analyze and interpret. On one hand, verification sticks to the functional ...
Steve Casselman, John Schewel, Christophe Beaumont
ECAI
2006
Springer
14 years 29 days ago
An Efficient Upper Approximation for Conditional Preference
The fundamental operation of dominance testing, i.e., determining if one alternative is preferred to another, is in general very hard for methods of reasoning with qualitative cond...
Nic Wilson
AAAI
2007
13 years 11 months ago
Randomized Adaptive Spatial Decoupling for Large-Scale Vehicle Routing with Time Windows
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
Russell Bent, Pascal Van Hentenryck
EVOW
2008
Springer
13 years 11 months ago
Enhancing Parameter Estimation of Biochemical Networks by Exponentially Scaled Search Steps
A fundamental problem of modelling in Systems Biology is to precisely characterise quantitative parameters, which are hard to measure experimentally. For this reason, it is common ...
Hendrik Rohn, Bashar Ibrahim, Thorsten Lenser, Tho...
DAGSTUHL
2007
13 years 10 months ago
Weighted Voronoi Region Algorithms for Political Districting
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...
Bruno Simeone, Federica Ricca, Andrea Scozzari