2474 search results - page 75 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
233
click to vote
EH
1999
IEEE
1999
IEEE
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
15 years 6 months ago
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
127
Voted
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
Parallel programming continues to be difficult, despite substantial and ongoing research aimed at making it tractable. Especially dismaying is the gulf between theory and the pract...
135
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
101
click to vote
PPOPP
2010
ACM
15 years 11 months ago
2010
ACM
This paper addresses the problem of extracting coarse-grained parallelism from large sequential code. It builds on BOP, a system for software speculative parallelization. BOP lets...
131
Voted
ICDCS
2003
IEEE
15 years 7 months ago
2003
IEEE
Writing correct distributed programs is hard. In spite of extensive testing and debugging, software faults persist even in commercial grade software. Many distributed systems, esp...