Sciweavers

4198 search results - page 65 / 840
» In search of lost time
Sort
View
CASES
2001
ACM
15 years 9 months ago
Efficient longest executable path search for programs with complex flows and pipeline effects
Current development tools for embedded real-time systems do not efficiently support the timing aspect. The most important timing parameter for scheduling and system analysis is th...
Friedhelm Stappert, Andreas Ermedahl, Jakob Engblo...
GLOBECOM
2006
IEEE
15 years 12 months ago
Pessimism Is Mostly the Best for the Expanding Ring Search in Wireless Networks
— Global flooding and expanding ring search are two commonly used methods in search for an interested object in multi-hop wireless networks. While global flooding is simple, it...
Kui Wu, Hong-Chuan Yang, Fulu Li
GECCO
2000
Springer
225views Optimization» more  GECCO 2000»
15 years 9 months ago
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
Kengo Katayama, Masafumi Tani, Hiroyuki Narihisa
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
15 years 7 months ago
Interpolation search for non-independent data
We define a deterministic metric of "well-behaved data" that enables searching along the lines of interpolation search. Specifically, define to be the ratio of distance...
Erik D. Demaine, Thouis R. Jones, Mihai Patrascu
GECCO
2005
Springer
108views Optimization» more  GECCO 2005»
15 years 11 months ago
Some theoretical results about the computation time of evolutionary algorithms
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
Lixin X. Ding, Jinghu Yu