2542 search results - page 105 / 509 » Computing Cartograms with Optimal Complexity |
125
click to vote
AAAI
1997
15 years 4 months ago
1997
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
135
Voted
CIBCB
2008
IEEE
15 years 10 months ago
2008
IEEE
— Solid tumors must recruit new blood vessels for growth and maintenance. Discovering drugs that block this tumor-induced development of new blood vessels (angiogenesis) is an im...
122
Voted
RTCSA
2000
IEEE
15 years 7 months ago
2000
IEEE
This paper introduces an exact schedulability analysis for the optional computation model urider a specified failure hypothesis. From this analysis, we propose a solutionfor deter...
127
Voted
CONCURRENCY
2004
15 years 3 months ago
2004
The centralized system approach for computer and telecommunication network management has been presenting scalability problems along with the growth in the number and diversity of...
121
Voted
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...