29046 search results - page 458 / 5810 » Computable Models |
152
Voted
FOCS
2008
IEEE
16 years 25 days ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
168
click to vote
COCOON
2007
Springer
16 years 17 days ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
163
click to vote
EUC
2007
Springer
16 years 17 days ago
2007
Springer
There are many research efforts that focus on converting everyday environments into intelligent and computationally active environments that support and enhance the abilities of it...
179
click to vote
UIC
2007
Springer
16 years 15 days ago
2007
Springer
The paper proposes a novel distributed service discovery method for the pervasive computing environment. The method is based on the concept of small world, policy-based advertiseme...
181
click to vote
COMPSAC
2005
IEEE
16 years 10 hour ago
2005
IEEE
Monitoring is a task of collecting measurements that reflect the state of a system. Administration is a collection of tasks for control and manipulation of computer systems. Monito...