1983 search results - page 322 / 397 » Competitive graph searches |
145
click to vote
IEEEPACT
1997
IEEE
15 years 7 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
154
click to vote
TABLEAUX
1998
Springer
15 years 7 months ago
1998
Springer
ple (Extended Abstract) Edmund M. Clarke and Sergey Berezin Carnegie Mellon University -- USA Model checking is an automatic verification technique for finite state concurrent syst...
ICTAI
1993
IEEE
15 years 7 months ago
1993
IEEE
The guidar project aims to support the complete activity of Graphical User Interface Development And Reuse. We propose to organize the system as a collaborative architecture of in...
120
click to vote
EVOW
2010
Springer
15 years 7 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
140
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...