Sciweavers

3864 search results - page 630 / 773
» time 2005
Sort
View
CC
2005
Springer
153views System Software» more  CC 2005»
15 years 9 months ago
Completeness Analysis for Incomplete Object-Oriented Programs
We introduce a new approach, called completeness analysis, to computing points-to sets for incomplete Java programs such as library modules or applications in the presence of dynam...
Jingling Xue, Phung Hua Nguyen
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
15 years 9 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
15 years 9 months ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom
ATAL
2007
Springer
15 years 8 months ago
Distributed agent-based air traffic flow management
Air traffic flow management is one of the fundamental challenges facing the Federal Aviation Administration (FAA) today. The FAA estimates that in 2005 alone, there were over 322,...
Kagan Tumer, Adrian K. Agogino
CHES
2006
Springer
152views Cryptology» more  CHES 2006»
15 years 7 months ago
Security Evaluation of DPA Countermeasures Using Dual-Rail Pre-charge Logic Style
In recent years, some countermeasures against Differential Power Analysis (DPA) at the logic level have been proposed. At CHES 2005 conference, Popp and Mangard proposed a new coun...
Daisuke Suzuki, Minoru Saeki