5658 search results - page 843 / 1132 » An Efficient Counting Network |
135
click to vote
MST
2006
15 years 6 months ago
2006
The "regularity" of a Boolean function can be exploited for decreasing its minimization time. It has already been shown that the notion of autosymmetry is a valid measure...
156
click to vote
4OR
2005
15 years 6 months ago
2005
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
149
click to vote
ADHOC
2004
15 years 6 months ago
2004
An ad hoc learning-automata-based protocol for wireless LANs, capable of operating efficiently under bursty traffic conditions, is introduced. According to the proposed protocol, ...
142
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
This paper initiates the use of vector fields to design, optimize, and implement reactive schedules for safe cooperative robot patterns on planar graphs. We consider Automated Gui...
205
click to vote
FGCS
2002
15 years 6 months ago
2002
High-performance computing increasingly occurs on "computational grids" composed of heterogeneous and geographically distributed systems of computers, networks, and stor...