13306 search results - page 392 / 2662 » Theoretical Computer Science |
177
Voted
TLCA
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. The Focal language (formerly FoC) allows one to incrementally build modules and to formally prove their correctness. In this paper, we present two formal semantics for en...
162
click to vote
GI
2004
Springer
16 years 6 days ago
2004
Springer
Abstract: The possibility of disconnection is one of the fundamental new networking problems presented by sensor networks. The goal of this paper is to address the problem of resul...
188
click to vote
STACS
2010
Springer
15 years 12 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...
207
click to vote
SCCC
2002
IEEE
15 years 11 months ago
2002
IEEE
The distribution of keys by a hash function as used in hash search with chaining is studied by considering the distribution of keys a random function from keys to buckets would gi...
159
click to vote
GI
2009
Springer
15 years 11 months ago
2009
Springer
Abstract: Store chains and service providers beguile customers with a pleasant shopping atmosphere often realized by installing scent diffusers to evaporate overwhelming fragrances...