Sciweavers

1603 search results - page 57 / 321
» Universal Confidence Sets for Solutions of Optimization Prob...
Sort
View
PATAT
2000
Springer
124views Education» more  PATAT 2000»
15 years 1 months ago
Tabu Search Techniques for Examination Timetabling
Abstract The Examination Timetabling problem regards the scheduling for the exams of a set of university courses, avoiding the overlapping of exams having students in common, fairl...
Luca Di Gaspero, Andrea Schaerf
MP
1998
134views more  MP 1998»
14 years 9 months ago
Second-order global optimality conditions for convex composite optimization
In recent years second-order sufficient conditions of an isolated local minimizer for convex composite optimization problems have been established. In this paper, second-order opt...
Xiaoqi Yang
CORR
2002
Springer
111views Education» more  CORR 2002»
14 years 10 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
CPAIOR
2005
Springer
15 years 3 months ago
Symmetry and Search in a Network Design Problem
Abstract. An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A const...
Barbara M. Smith
SSDBM
2003
IEEE
96views Database» more  SSDBM 2003»
15 years 3 months ago
Space Constrained Selection Problems for Data Warehouses and Pervasive Computing
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
Themistoklis Palpanas, Nick Koudas, Alberto O. Men...