Sciweavers

2926 search results - page 379 / 586
» Partially Optimal Routing
Sort
View
115
Voted
CPAIOR
2005
Springer
15 years 9 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
143
Voted
SAS
1999
Springer
106views Formal Methods» more  SAS 1999»
15 years 7 months ago
Static Analyses for Eliminating Unnecessary Synchronization from Java Programs
This paper presents and evaluates a set of analyses designed to reduce synchronization overhead in Java programs. Monitor-based synchronization in Java often causes significant ove...
Jonathan Aldrich, Craig Chambers, Emin Gün Si...
132
Voted
CEC
2008
IEEE
15 years 5 months ago
Directed trees: A powerful representation for sorting and ordering problems
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
Benjamin Doerr, Edda Happ
124
Voted
ATMOS
2007
163views Optimization» more  ATMOS 2007»
15 years 5 months ago
Branching Strategies to Improve Regularity of Crew Schedules in Ex-Urban Public Transit
We discuss timetables in ex-urban bus traffic that consist of many trips serviced every day together with some exceptions that do not repeat daily. Traditional optimization methods...
Ingmar Steinzen, Leena Suhl, Natalia Kliewer
146
Voted
AAAI
2006
15 years 4 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...