Sciweavers

4110 search results - page 18 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
103
Voted
GEM
2008
15 years 5 months ago
Evaluating a Parallel Evolutionary Algorithm on the Chess Endgame Problem
Classifying the endgame positions in Chess can be challenging for humans and is known to be a difficult task in machine learning. An evolutionary algorithm would seem to be the ide...
Wayne Iba, Kelsey Marshman, Benjamin Fisk
JPDC
2006
117views more  JPDC 2006»
15 years 3 months ago
Efficient synthesis of out-of-core algorithms using a nonlinear optimization solver
We address the problem of efficient out-of-core code generation for a special class of imperfectly nested loops encoding tensor contractions arising in quantum chemistry computati...
Sandhya Krishnan, Sriram Krishnamoorthy, Gerald Ba...
123
Voted
ATAL
2006
Springer
15 years 7 months ago
MDPOP: faithful distributed implementation of efficient social choice problems
We model social choice problems in which self interested agents with private utility functions have to agree on values for a set of variables subject to side constraints. The goal...
Adrian Petcu, Boi Faltings, David C. Parkes
121
Voted
AMC
2005
195views more  AMC 2005»
15 years 3 months ago
A new symbolic computational approach to singular initial value problems in the second-order ordinary differential equations
This paper presents a new symbolic algorithm to compute the singular initial value problem of second-order ordinary differential equations using Adomian decomposition method. The ...
Onur Kiymaz, Seref Mirasyedioglu
BMCBI
2006
100views more  BMCBI 2006»
15 years 3 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong