5606 search results - page 807 / 1122 » Randomization Techniques for Graphs. |
145
click to vote
WAOA
2004
Springer
16 years 2 days ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
186
click to vote
ISWC
2003
IEEE
16 years 2 hour ago
2003
IEEE
Context-aware computing describes the situation where a wearable / mobile computer is aware of its user’s state and surroundings and modifies its behavior based on this informat...
156
click to vote
IV
2003
IEEE
16 years 1 hour ago
2003
IEEE
In this paper we present a “lightweight” visual formalism that can be used to examine the state space complexity of an interface. The method can form a basis for designing, te...
173
click to vote
CONCUR
2003
Springer
15 years 12 months ago
2003
Springer
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...
183
Voted
3DPVT
2002
IEEE
15 years 11 months ago
2002
IEEE
Because of the convenience of a text-based format 3D content is often published in form of a gzipped file that contains an ASCII description of the scene graph. While compressed ...