9842 search results - page 1363 / 1969 » The Complexity of the Matching-Cut Problem |
190
click to vote
LCPC
2005
Springer
16 years 22 days ago
2005
Springer
Abstract. Many embedded systems use single-chip microcontrollers which have no on-chip RAM. In such a system, the processor registers must hold all live data values. Nanocontroller...
204
click to vote
DAGM
2003
Springer
16 years 13 days ago
2003
Springer
Compared to their ancestors in the early 1970s, present day computer games are of incredible complexity and show magnificent graphical performance. However, in programming intelli...
271
click to vote
COOPIS
2002
IEEE
16 years 5 days ago
2002
IEEE
Rapid advances in networking, hardware, and middleware technologies are facilitating the development and deployment of complex grid applications, such as large-scale distributed co...
244
click to vote
DAWAK
2001
Springer
15 years 11 months ago
2001
Springer
A fundamental task in multi-agent systems is matchmaking, which is to retrieve and classify service descriptions of agents that (best) match a given service request. Several approa...
189
click to vote
ICSE
2001
IEEE-ACM
15 years 11 months ago
2001
IEEE-ACM
An emerging tapestry of computations will soon integrate systems around the globe. It will evolve without central control. Its complexity will be vast. We need new ideas, tools an...