Sciweavers

2343 search results - page 378 / 469
» The Locomotive Routing Problem
Sort
View
152
Voted
TACAS
2012
Springer
288views Algorithms» more  TACAS 2012»
14 years 2 days ago
Reduction-Based Formal Analysis of BGP Instances
Today’s Internet interdomain routing protocol, the Border Gateway Protocol (BGP), is increasingly complicated and fragile due to policy misconfigurations by individual autonomou...
Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gu...
ATAL
2010
Springer
15 years 5 months ago
Coalition formation with spatial and temporal constraints
The coordination of emergency responders and robots to undertake a number of tasks in disaster scenarios is a grand challenge for multi-agent systems. Central to this endeavour is...
Sarvapali D. Ramchurn, Maria Polukarov, Alessandro...
CEC
2010
IEEE
15 years 5 months ago
Constrained global optimization of low-thrust interplanetary trajectories
The optimization of spacecraft trajectories can be formulated as a global optimization task. The complexity of the problem depends greatly on the problem formulation, on the spacec...
Chit Hong Yam, David Di Lorenzo, Dario Izzo
COMGEO
2006
ACM
15 years 4 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
DAC
2003
ACM
16 years 5 months ago
On-chip logic minimization
While Boolean logic minimization is typically used in logic synthesis, logic minimization can be useful in numerous other applications. However, many of those applications, such a...
Roman L. Lysecky, Frank Vahid