552 search results - page 30 / 111 » Reducing Time Complexity in RFID Systems |
PODC
2006
ACM
14 years 2 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
RECOMB
2007
Springer
14 years 8 months ago
2007
Springer
Abstract. Given the substantial computational requirements of stochastic simulation, approximation is essential for efficient analysis of any realistic biochemical system. This pap...
ICDE
2003
IEEE
14 years 9 months ago
2003
IEEE
Access Control policies in e-commerce domain can be quite complex, affecting the response time provided to the users. We describe an event-based access control system that can pot...
AAAI
2006
13 years 9 months ago
2006
hibition: Extended Abstract Social insects, such as ants and termites, collectively build large and complex structures, with many individuals following simple rules and no centrali...
CASES
2009
ACM
14 years 2 months ago
2009
ACM
Embedded processors have become increasingly complex, resulting in variable execution behavior and reduced timing predictability. On such processors, safe timing specifications e...