Sciweavers

850 search results - page 51 / 170
» heuristics 2006
Sort
View
ICCAD
2006
IEEE
128views Hardware» more  ICCAD 2006»
14 years 8 months ago
Improvements to combinational equivalence checking
The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use simulat...
Alan Mishchenko, Satrajit Chatterjee, Robert K. Br...
INFOCOM
2006
IEEE
14 years 5 months ago
Considering Priority in Overlay Multicast Protocols Under Heterogeneous Environments
— Hosts participating in overlay multicast applications have a wide range of heterogeneity in bandwidth and participation characteristics. In this paper, we highlight and show th...
Michael A. Bishop, Sanjay G. Rao, Kunwadee Sripani...
WECWIS
2006
IEEE
78views ECommerce» more  WECWIS 2006»
14 years 5 months ago
Improving Patient Activity Schedules by Multi-agent Pareto Appointment Exchanging
We present a dynamic and distributed approach to the hospital patient scheduling problem: the multi-agent Pareto-improvement appointment exchanging algorithm, MPAEX. It respects t...
Ivan B. Vermeulen, Sander M. Bohte, D. J. A. Somef...
AOR
2006
74views more  AOR 2006»
13 years 11 months ago
Note on Upper Bounds for TSP Domination Number
The domination number, domn(A, n), of a heuristic A for the Asymmetric TSP is the maximum integer d = d(n) such that, for every instance I of the Asymmetric TSP on n cities, A pro...
Gregory Gutin, Angela Koller, Anders Yeo
COR
2006
62views more  COR 2006»
13 years 11 months ago
Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls
This paper presents a heuristic to solve the Multidimensional Multiple-choice Knapsack Problem (MMKP), a variant of the classical 0
Md. Mostofa Akbar, Mohammad Sohel Rahman, Mohammad...