Sciweavers

16188 search results - page 267 / 3238
» The Optimal PAC Algorithm
Sort
View
MOR
2007
149views more  MOR 2007»
15 years 6 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
TVCG
2010
166views more  TVCG 2010»
15 years 5 months ago
An Extension of Wilkinson's Algorithm for Positioning Tick Labels on Axes
—The non-data components of a visualization, such as axes and legends, can often be just as important as the data itself. They provide contextual information essential to interpr...
Justin Talbot, Sharon Lin, Pat Hanrahan
CPAIOR
2009
Springer
16 years 1 months ago
Backdoors to Combinatorial Optimization: Feasibility and Optimality
There has been considerable interest in the identification of structural properties of combinatorial problems that lead, directly or indirectly, to the development of efficient al...
Bistra N. Dilkina, Carla P. Gomes, Yuri Malitsky, ...
EUSFLAT
2009
175views Fuzzy Logic» more  EUSFLAT 2009»
15 years 4 months ago
Ant Colony Optimization for Distributed Routing Path Optimization in Optical Burst-Switched Networks
This work describes a distributed framework for routing path optimization in Optical Burst-Switched (OBS) networks that loosely mimics the foraging behaviour of ants observed in na...
João Pedro, João Pires, João ...
CEC
2009
IEEE
16 years 1 months ago
Differential Evolution with Self-adaptation and Local Search for Constrained Multiobjective Optimization
— This paper presents Differential Evolution with Self-adaptation and Local Search for Constrained Multiobjective Optimization algorithm (DECMOSA-SQP), which uses the self-adapta...
Ales Zamuda, Janez Brest, Borko Boskovic, Viljem Z...