Sciweavers

1639 search results - page 122 / 328
» Anytime Heuristic Search
Sort
View
GECCO
2004
Springer
14 years 3 months ago
Three Evolutionary Codings of Rectilinear Steiner Arborescences
A rectilinear Steiner arborescence connects points in the Euclidean plane’s first quadrant and the origin with directed rectilinear edges from the origin up and to the right. Th...
Bryant A. Julstrom, Athos Antoniades
PDPTA
2003
13 years 11 months ago
Queryball: A New Model for Querying in Immersive VR Systems
— In this paper, we propose a powerful and convenient querying model, "Queryball", for users to query in immersive VR systems. In immersive VR systems, users expect int...
Chiemi Watanabe, Ayumi Osugi, Yoshifumi Masunaga, ...
ML
2008
ACM
156views Machine Learning» more  ML 2008»
13 years 10 months ago
On the connection between the phase transition of the covering test and the learning success rate in ILP
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
Érick Alphonse, Aomar Osmani
IWANN
2009
Springer
14 years 4 months ago
Efficient Exact Pattern-Matching in Proteomic Sequences
Abstract. This paper proposes a novel algorithm for complete exact patternmatching focusing the specificities of protein sequences (alphabet of 20 symbols) but, also highly efficie...
Sérgio A. D. Deusdado, Paulo M. M. Carvalho
ASPDAC
2005
ACM
91views Hardware» more  ASPDAC 2005»
14 years 3 months ago
Efficiently generating test vectors with state pruning
- This paper extends the depth first search (DFS) used in the previously proposed witness string method for generating efficient test vectors. A state pruning method is added that ...
Ying Chen, Dennis Abts, David J. Lilja