Sciweavers

1040 search results - page 187 / 208
» Tools for modeling and solving search problems
Sort
View
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 4 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
15 years 2 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
JCDL
2006
ACM
151views Education» more  JCDL 2006»
15 years 4 months ago
Tagging of name records for genealogical data browsing
In this paper we present a method of parsing unstructured textual records briefly describing a person and their direct relatives, which we use in the construction of a browsing t...
Mike Perrow, David Barber
99
Voted
CSDA
2008
128views more  CSDA 2008»
14 years 10 months ago
Classification tree analysis using TARGET
Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness,...
J. Brian Gray, Guangzhe Fan
105
Voted
JMLR
2006
124views more  JMLR 2006»
14 years 10 months ago
Policy Gradient in Continuous Time
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
Rémi Munos