Sciweavers

3082 search results - page 275 / 617
» New Bounds for the Controller Problem
Sort
View
CPC
2008
66views more  CPC 2008»
15 years 6 months ago
B2[ g] Sets and a Conjecture of Schinzel and Schmidt
A set of integers A is called a B2[g] set if every integer m has at most g representations of the form m = a + a , with a a and a, a A. We obtain a new lower bound for F(g, n), t...
Javier Cilleruelo, Carlos Vinuesa
MP
2007
142views more  MP 2007»
15 years 6 months ago
Active-constraint variable ordering for faster feasibility of mixed integer linear programs
The selection of the branching variable can greatly affect the speed of the branch and bound solution of a mixed-integer or integer linear program. Traditional approaches to branc...
Jagat Patel, John W. Chinneck
JMLR
2011
137views more  JMLR 2011»
15 years 1 months ago
Online Learning in Case of Unbounded Losses Using Follow the Perturbed Leader Algorithm
In this paper the sequential prediction problem with expert advice is considered for the case where losses of experts suffered at each step cannot be bounded in advance. We presen...
Vladimir V. V'yugin
DATE
2010
IEEE
153views Hardware» more  DATE 2010»
15 years 11 months ago
Taming the component timing: A CBD methodology for real-time embedded systems
—The growing trend towards using component based design approach in embedded system development requires addressing newer system engineering challenges. These systems are usually...
Manoj G. Dixit, Pallab Dasgupta, S. Ramesh
VLDB
1994
ACM
129views Database» more  VLDB 1994»
15 years 10 months ago
Hilbert R-tree: An Improved R-tree using Fractals
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
Ibrahim Kamel, Christos Faloutsos