Sciweavers

807 search results - page 90 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
135
Voted
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
15 years 9 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm
152
Voted
BMCBI
2007
166views more  BMCBI 2007»
15 years 3 months ago
How to decide which are the most pertinent overly-represented features during gene set enrichment analysis
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...
Roland Barriot, David J. Sherman, Isabelle Dutour
154
Voted
AI
2002
Springer
15 years 3 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm
104
Voted
WEBI
2004
Springer
15 years 9 months ago
Using Semantic Graphs in Clustering Process : Enhance Information Level
In this paper, we particularly focused our attention on how to enhance expressivity of ontologies when used as organized space values in a catalogue request process. Using the Wis...
Jean-Sébastien Brunner, Isabelle Berrien
135
Voted
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
15 years 7 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley