19395 search results - page 2 / 3879 » Searching for |
IANDC
2008
13 years 5 months ago
2008
Search games are attractive for their correspondence with classical width parameters. For instance, the invisible search number (a.k.a. node search number) of a graph is equal to
BIBE
2007
IEEE
14 years 53 min ago
2007
IEEE
—The performance of maximum likelihood searches can be boosted by using the most parsimonious tree as a starting point for the search. The time spent in performing the parsimony ...
CP
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We describe a small, non-intrusive extension to the declarative modelling language Zinc that allows users to define model-specific search. This is achieved by providing a...
ICNC
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Small populations are very desirable for reducing the required computational resources in evolutionary optimization of complex real-world problems. Unfortunately, the sea...
RIAO
2007
13 years 7 months ago
2007
Search engines are among the most useful Internet applications. There exist several media types on the Web and, given the particularities of each of them, adapted search solutions...