Sciweavers

442 search results - page 48 / 89
» Discovering Heuristic Strategy for Solving Scheduling Proble...
Sort
View
DSN
2009
IEEE
16 years 7 days ago
Fitness-guided path exploration in dynamic symbolic execution
Dynamic symbolic execution is a structural testing technique that systematically explores feasible paths of the program under test by running the program with different test input...
Tao Xie, Nikolai Tillmann, Jonathan de Halleux, Wo...
WSC
2008
15 years 7 months ago
Approximate dynamic programming: Lessons from the field
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
Warren B. Powell
116
Voted
WEA
2005
Springer
105views Algorithms» more  WEA 2005»
15 years 11 months ago
Inferring AS Relationships: Dead End or Lively Beginning?
Recent techniques for inferring business relationships between ASs [3, 8] have yielded maps that have extremely few invalid BGP paths in the terminology of Gao [9]. However, some ...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, B...
ISSS
1998
IEEE
129views Hardware» more  ISSS 1998»
15 years 9 months ago
Application-Specific Heterogeneous Multiprocessor Synthesis Using Differential-Evolution
This paper presents an application-specific, heterogeneous multiprocessor synthesis system, named HeMPS, that combines a form of Evolutionary Computation known as Differential Evo...
Allan Rae, Sri Parameswaran
ICPP
2002
IEEE
15 years 10 months ago
BPA: A Fast Packet Scheduling Algorithm for Real-Time Switched Ethernet Networks
In this paper, we present a MAC-Iayer packet scheduling algorithm called BPA, for real-time switched Ethernet networks. BPA considers a message model where trans-node application-...
Jinggang Wang, Binoy Ravindran