Sciweavers

3218 search results - page 246 / 644
» Timed Extensions for SDL
Sort
View
DC
2010
15 years 6 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
COMCOM
2007
139views more  COMCOM 2007»
15 years 6 months ago
Performance evaluation of scheduling in IEEE 802.16 based wireless mesh networks
IEEE 802.16 employs TDMA (Time Division Multiple Access) as the access method and the policy for selecting scheduled links in a given time slot will definitely impact the system ...
Bo Han, Weijia Jia, Lidong Lin
JSAC
2006
131views more  JSAC 2006»
15 years 6 months ago
On Dynamic Optimization of Packet Matching in High-Speed Firewalls
Abstract--Packet matching plays a critical role in the performance of many network devices and a tremendous amount of research has already been invested to come up with better opti...
Hazem Hamed, Adel El-Atawy, Ehab Al-Shaer
EOR
2007
69views more  EOR 2007»
15 years 6 months ago
Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts
— We describe a solution procedure for a special case of the periodic vehicle routing problem (PVRP). Operation managers at an auto parts in the north of Spain described the opti...
Jesús F. Alegre, Manuel Laguna, Joaqu&iacut...
ANOR
2005
93views more  ANOR 2005»
15 years 6 months ago
Looking Ahead with the Pilot Method
The pilot method as a meta-heuristic is a tempered greedy method aimed at obtaining better solutions while avoiding the greedy trap by looking ahead for each possible choice. Repea...
Stefan Voß, Andreas Fink, Cees Duin