Sciweavers

5214 search results - page 54 / 1043
» The Online Specialization Problem
Sort
View
ORL
2008
99views more  ORL 2008»
13 years 7 months ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...
MA
2011
Springer
219views Communications» more  MA 2011»
13 years 2 months ago
Quadratic minimisation problems in statistics
We consider the problem minx(x−t) A(x−t) subject to x Bx + 2b x = k where A is positive definite or positive semidefinite. Commonly occurring statistical variants of this pro...
Casper J. Albers, Frank Critchley, John C. Gower
JGS
2000
182views more  JGS 2000»
13 years 7 months ago
The academic success of GIS in geography: Problems and prospects
The success of GIS has in some ways proved to be a mixed blessing to academic geography. While quantitative geography has developed as a disciplinary specialism over a long period ...
Paul A. Longley
ALT
2011
Springer
12 years 7 months ago
Semantic Communication for Simple Goals Is Equivalent to On-line Learning
Abstract. Previous works [11, 6] introduced a model of semantic communication between a “user” and a “server,” in which the user attempts to achieve a given goal for commun...
Brendan Juba, Santosh Vempala
STOC
1997
ACM
129views Algorithms» more  STOC 1997»
13 years 12 months ago
Better Bounds for Online Scheduling
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...
Susanne Albers