Sciweavers

920 search results - page 32 / 184
» Generating Satisfiable Problem Instances
Sort
View
AISC
2008
Springer
14 years 11 days ago
Strategies for Solving SAT in Grids by Randomized Search
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
EVOW
2009
Springer
13 years 8 months ago
The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
Philipp Rohlfshagen, Xin Yao
COR
2007
183views more  COR 2007»
13 years 10 months ago
Arcs-states models for the vehicle routing problem with time windows and related problems
This paper presents several Arcs-States models that can be applied to numerous vehicle routing problems, one of which is the well-known vehicle routing problem with capacities and...
Thierry Mautor, Edith Naudin
IESS
2007
Springer
156views Hardware» more  IESS 2007»
14 years 4 months ago
Automatic Data Path Generation from C code for Custom Processors
The stringent performance constraints and short time to market of modern digital systems require automatic methods for design of high performance applicationspeciļ¬c architectures...
Jelena Trajkovic, Daniel Gajski
ATVA
2008
Springer
143views Hardware» more  ATVA 2008»
14 years 11 days ago
Automating Algebraic Specifications of Non-freely Generated Data Types
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif