Sciweavers

1259 search results - page 42 / 252
» In search of the memoryless property
Sort
View
ATAL
2010
Springer
13 years 9 months ago
Adversarial planning for large multi-agent simulations
We investigate planning for self-interested agents in large multi-agent simulations. We present two heuristic algorithms that exploit different domain-specific properties in order...
Viliam Lisý
JCO
2007
130views more  JCO 2007»
13 years 7 months ago
On edge orienting methods for graph coloring
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
Bernard Gendron, Alain Hertz, Patrick St-Louis
BMCBI
2006
85views more  BMCBI 2006»
13 years 7 months ago
Searching for interpretable rules for disease mutations: a simulated annealing bump hunting strategy
Background: Understanding how amino acid substitutions affect protein functions is critical for the study of proteins and their implications in diseases. Although methods have bee...
Rui Jiang, Hua Yang, Fengzhu Sun, Ting Chen
WEBDB
2004
Springer
100views Database» more  WEBDB 2004»
14 years 1 months ago
Spam, Damn Spam, and Statistics: Using Statistical Analysis to Locate Spam Web Pages
The increasing importance of search engines to commercial web sites has given rise to a phenomenon we call “web spam”, that is, web pages that exist only to mislead search eng...
Dennis Fetterly, Mark Manasse, Marc Najork
CEC
2007
IEEE
13 years 8 months ago
Designing memetic algorithms for real-world applications using self-imposed constraints
— Memetic algorithms (MAs) combine the global exploration abilities of evolutionary algorithms with a local search to further improve the solutions. While a neighborhood can be e...
Thomas Michelitsch, Tobias Wagner, Dirk Biermann, ...