2474 search results - page 256 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
170
Voted
CONCUR
2003
Springer
15 years 11 months ago
2003
Springer
We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” ...
187
click to vote
ISPD
2004
ACM
15 years 12 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
146
Voted
IRREGULAR
1997
Springer
15 years 10 months ago
1997
Springer
ing with shared data abstractions Simon Dobson1 and Don Goodeve2 1 Well-Founded Systems Unit, CLRC Rutherford Appleton Laboratory, UK 2 School of Computer Studies, University of Le...
182
Voted
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The conversion and extension of the Incremental ParetoCoevolution Archive algorithm (IPCA) into the domain of Genetic Programming classifier evolution is presented. In order to ac...
150
click to vote
COR
2010
15 years 6 months ago
2010
In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable ...