Sciweavers

3020 search results - page 500 / 604
» Optimal partition trees
Sort
View
IJCAI
1989
15 years 7 months ago
A Study of Empirical Learning for an Involved Problem
In real-world domains a concept to be learned may be unwieldy and the environment may be less than ideal. One combination of difficulties occurs if the concept is probabilistic an...
Larry A. Rendell
IPCO
1992
112views Optimization» more  IPCO 1992»
15 years 7 months ago
The Metric Polytope
In this paper we study enumeration problems for polytopes arising from combinatorial optimization problems. While these polytopes turn out to be quickly intractable for enumeration...
Monique Laurent, Svatopluk Poljak
CSL
2010
Springer
15 years 7 months ago
Energy and Mean-Payoff Games with Imperfect Information
We consider two-player games with imperfect information and quantitative objective. The game is played on a weighted graph with a state space partitioned into classes of indistingu...
Aldric Degorre, Laurent Doyen, Raffaella Gentilini...
ESA
2010
Springer
161views Algorithms» more  ESA 2010»
15 years 7 months ago
Top-k Ranked Document Search in General Text Databases
Text search engines return a set of k documents ranked by similarity to a query. Typically, documents and queries are drawn from natural language text, which can readily be partiti...
J. Shane Culpepper, Gonzalo Navarro, Simon J. Pugl...
ALGORITHMICA
2007
145views more  ALGORITHMICA 2007»
15 years 6 months ago
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...