89
Voted
ATVA
2006
Springer
15 years 7 months ago
2006
Springer
We consider infinite-state discrete Markov chains which are eager: the probability of avoiding a defined set of final states for more than
113
Voted
COMPSAC
2004
IEEE
15 years 7 months ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
84
Voted
COMPSAC
2004
IEEE
15 years 7 months ago
2004
IEEE
104
Voted
COMPSAC
2004
IEEE
15 years 7 months ago
2004
IEEE
A key challenge in ubiquitous computing is how to manage ambient information about the environment where a variety of devices appear. Traditional capability descriptions are inadeq...
163
Voted
ATC
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. To overcome increasing complexity and dynamic nature of distributed computing system, such as ubiquitous computing systems, it is critical to have computing systems that ...