Sciweavers

6894 search results - page 311 / 1379
» Generation Problems
Sort
View
JUCS
2007
98views more  JUCS 2007»
15 years 6 months ago
Random k-GD-Sat Model and its Phase Transition
Abstract: We present a new type of sat problem called the k-gd-sat, which generalizes k-sat and gd-sat. In k-gd-sat, clause lengths have geometric distribution, controlled by a pro...
Milena Vujosevic-Janicic, Jelena Tomasevic, Predra...
SIAMJO
2002
124views more  SIAMJO 2002»
15 years 6 months ago
The Sample Average Approximation Method for Stochastic Discrete Optimization
In this paper we study a Monte Carlo simulation based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and...
Anton J. Kleywegt, Alexander Shapiro, Tito Homem-d...
288
Voted
SIGMOD
2006
ACM
89views Database» more  SIGMOD 2006»
16 years 6 months ago
Testing database applications
Testing of database applications is crucial for ensuring high software quality as undetected faults can result in unrecoverable data corruption. The problem of database applicatio...
Carsten Binnig, Donald Kossmann, Eric Lo
GECCO
2004
Springer
211views Optimization» more  GECCO 2004»
16 years 2 days ago
Node-Depth Encoding for Evolutionary Algorithms Applied to Network Design
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
Alexandre C. B. Delbem, André Carlos Ponce ...
CSR
2007
Springer
16 years 26 days ago
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
Abstract It has recently been proved (Je˙z, DLT 2007) that conjunctive grammars (that is, context-free grammars augmented by conjunction) generate some nonregular languages over a...
Artur Jez, Alexander Okhotin