3455 search results - page 431 / 691 » Generalized Game Trees |
208
click to vote
FAW
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
175
click to vote
GECCO
2007
Springer
16 years 25 days ago
2007
Springer
This paper presents a novel approach to clustering using an accuracy-based Learning Classifier System. Our approach achieves this by exploiting the generalization mechanisms inher...
197
click to vote
IDEAL
2005
Springer
16 years 5 days ago
2005
Springer
Recently, there has been a considerable research activity in extending topographic maps of vectorial data to more general data structures, such as sequences or trees. However, the ...
168
click to vote
PASTE
2004
ACM
16 years 3 days ago
2004
ACM
We present an improved slicing algorithm for Java. The best algorithm known so far, first presented in [11], is not always precise if nested objects are used as actual parameters...
146
click to vote
PADS
1999
ACM
15 years 11 months ago
1999
ACM
This paper introduces the Critical Channel Traversing (CCTJ algorithm, a new scheduling algorithm for both sequential and parallel discrete event simulation. CCT is a general cons...