3229 search results - page 550 / 646 » The Theory of Timed Automata |
174
click to vote
ICFP
2007
ACM
16 years 5 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
185
click to vote
MOBIHOC
2004
ACM
16 years 5 months ago
2004
ACM
Clock synchronization is a crucial basic service in typical sensor networks, since the observations of distributed sensors more often than not need to be ordered ("a happened...
160
click to vote
SPAA
2009
ACM
16 years 20 days ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
144
click to vote
ICC
2009
IEEE
16 years 18 days ago
2009
IEEE
— This paper presents a simple method for computing throughputs of links in a CSMA network. We call our method back-of-the-envelop (BoE) computation, because for many network con...
140
click to vote
GECCO
2009
Springer
16 years 12 days ago
2009
Springer
A recent theoretical investigation of modular representations shows that certain modularizations can introduce a distance bias into a landscape. This was a static analysis, and em...