Sciweavers

7167 search results - page 1179 / 1434
» Answer Set Programming
Sort
View
95
Voted
FMCO
2007
Springer
103views Formal Methods» more  FMCO 2007»
15 years 8 months ago
Safety Guarantees from Explicit Resource Management
We present a language and a program analysis that certifies the safe use of flexible resource management idioms, in particular advance reservation or “block booking” of costl...
David Aspinall, Patrick Maier, Ian Stark
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
15 years 8 months ago
A multi-objective approach to search-based test data generation
There has been a considerable body of work on search–based test data generation for branch coverage. However, hitherto, there has been no work on multi–objective branch covera...
Kiran Lakhotia, Mark Harman, Phil McMinn
GECCO
2007
Springer
173views Optimization» more  GECCO 2007»
15 years 8 months ago
A hybrid GA for a supply chain production planning problem
The problem of production and delivery lot-sizing and scheduling of set of items in a two-echelon supply chain over a finite planning horizon is addressed in this paper. A single ...
Masoud Jenabi, S. Ali Torabi, S. Afshin Mansouri
109
Voted
HIPC
2007
Springer
15 years 8 months ago
Experiments with a Parallel External Memory System
Abstract. The theory of bulk-synchronous parallel computing has produced a large number of attractive algorithms, which are provably optimal in some sense, but typically require th...
Mohammad R. Nikseresht, David A. Hutchinson, Anil ...
130
Voted
ICALP
2007
Springer
15 years 8 months ago
Reconciling Data Compression and Kolmogorov Complexity
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
Laurent Bienvenu, Wolfgang Merkle
« Prev « First page 1179 / 1434 Last » Next »