Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
Abstract— We present a method of dynamic coalition formation (DCF) in sensor networks to achieve well-informed sensor-target allocations. Forecasts of target movements are incorp...
New approaches are considered for performance enhancement of discrete-event simulation software. Instead of taking a purely algorithmic analysis view, we supplement algorithmic co...
Alex Bahouth, Steven Crites, Norman Matloff, Todd ...
The performance of many scientific applications for distributed memory platforms can be increased by utilizing multiprocessor-task programming. To obtain the minimum parallel runt...
We give faster algorithms for two methods of reducing the number of states in nondeterministic finite automata. The first uses equivalences and the second uses preorders. We deve...