100 search results - page 9 / 20 » Distributed Algorithm for Computing Formal Concepts Using Ma... |
IANDC
2007
13 years 7 months ago
2007
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
ANOR
2005
13 years 7 months ago
2005
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
ICDCSW
2002
IEEE
14 years 12 days ago
2002
IEEE
There are many challenges in devising solutions for online content processing of live networked multimedia sessions. These include the computational complexity of feature extracti...
IEEEPACT
2006
IEEE
14 years 1 months ago
2006
IEEE
Transactional memory is an attractive design concept for scalable multiprocessors because it offers efficient lock-free synchronization and greatly simplifies parallel software....
CN
2002
13 years 7 months ago
2002
In todays IP networks most of the network control and management tasks are performed at the end points. As a result, many important network functions cannot be optimized due to la...