Sciweavers

3082 search results - page 3 / 617
» New Bounds for the Controller Problem
Sort
View
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 9 days ago
Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
Yasin Abbasi-Yadkori, Dávid Pál, Csa...
ORL
2007
54views more  ORL 2007»
13 years 4 months ago
A new lower bound for the non-oriented two-dimensional bin-packing problem
We propose a new scheme for computing lower bounds for the non-oriented bin-packing problem when the bin is a square. It leads to bounds that theoretically dominate previous resul...
François Clautiaux, Antoine Jouglet, Joseph...
CP
2000
Springer
13 years 9 months ago
New Search Heuristics for Max-CSP
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
Kalev Kask
CP
2001
Springer
13 years 9 months ago
New Lower Bounds of Constraint Violations for Over-Constrained Problems
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...
Jean-Charles Régin, Thierry Petit, Christia...
ISSAC
2007
Springer
112views Mathematics» more  ISSAC 2007»
13 years 11 months ago
G-graphs for the cage problem: a new upper bound
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
Alain Bretto, Luc Gillibert