2107 search results - page 283 / 422 » Computing Small Search Numbers in Linear Time |
QEST
2009
IEEE
14 years 3 months ago
2009
IEEE
—Gossip protocols are designed to operate in very large, decentralised networks. A node in such a network bases its decision to interact (gossip) with another node on its partial...
EUROPAR
2007
Springer
14 years 3 months ago
2007
Springer
An optimizing compiler has a hard time to generate a code which will perform at top speed for an arbitrary data set size. In general, the low level optimization process must take i...
ECAIW
2000
Springer
14 years 1 months ago
2000
Springer
This paper discusses the hierarchical control architecture used to generate the behavior of individual agents and a team of robots for the RoboCup Small Size competition. Our react...
ISCAS
2003
IEEE
14 years 2 months ago
2003
IEEE
– The traditional way of approaching placement problems in computer-aided design (CAD) tools for analog layout is to explore an extremely large search space of feasible or unfeas...
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
— The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectiv...