Sciweavers

3558 search results - page 259 / 712
» Object-Oriented Programming on the Network
Sort
View
COCOON
2005
Springer
16 years 4 days ago
Bicriteria Network Design via Iterative Rounding
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
Piotr Krysta
ACL
1997
15 years 8 months ago
Choosing the Word Most Typical in Context Using a Lexical Co-Occurrence Network
This paper presents a partial solution to a component of the problem of lexical choice: choosing the synonym most typical, or expected, in context. We apply a new statistical appr...
Philip Edmonds
IJSYSC
2006
113views more  IJSYSC 2006»
15 years 6 months ago
Neural network approach to collision free path-planning for robotic manipulators
: The paper deals with collision free path planning for industrial robotic manipulators. A new efficient algorithm is proposed that is based on a topologically ordered neural netwo...
Anatoly Pashkevich, M. Kazheunikau, A. E. Ruano
205
Voted
EMSOFT
2004
Springer
15 years 12 months ago
Reactive process networks
Data flow process networks are a good model of computation for streaming multimedia applications incorporating audio, video and/or graphics streams. Process networks are concurre...
Marc Geilen, Twan Basten
MOBISYS
2005
ACM
16 years 6 months ago
Design and implementation of a single system image operating system for ad hoc networks
In this paper, we describe the design and implementation of a distributed operating system for ad hoc networks. Our system simplifies the programming of ad hoc networks and extend...
Hongzhou Liu, Tom Roeder, Kevin Walsh, Rimon Barr,...