1379 search results - page 177 / 276 » The Complexity of the Annihilating Polynomial |
159
click to vote
ATAL
2001
Springer
15 years 11 months ago
2001
Springer
In the last few years the use of coalition formation algorithms in multi-agent systems has been proposed as a possible way of modelling autonomous agent cooperation. Game theory pr...
205
click to vote
RANDOM
2001
Springer
15 years 10 months ago
2001
Springer
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨© ¤¥ ¦ §¨ belongs to a certain class of Boolean functions or whether it is far from the...
215
click to vote
INFOCOM
2000
IEEE
15 years 10 months ago
2000
IEEE
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...
152
click to vote
CPM
2000
Springer
15 years 10 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
140
click to vote
ISSS
1999
IEEE
15 years 10 months ago
1999
IEEE
Portable or embedded systems allow more and more complex applications like multimedia today. These applications and submicronic technologies have made the power consumption criter...