11740 search results - page 327 / 2348 » More Problems in Rewriting |
160
click to vote
EVOW
2010
Springer
15 years 11 months ago
2010
Springer
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...
220
Voted
INFOCOM
2000
IEEE
15 years 11 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 ...
162
click to vote
CPM
2000
Springer
15 years 11 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...
171
click to vote
ECAI
2000
Springer
15 years 11 months ago
2000
Springer
This paper considers the use of logic-based languages for multi-agent negotiation. We begin by motivating the use of such languages, and introducing a formal model of logic-based n...
162
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
The scheduling of application tasks is a problem that occurs in all multiprocessor systems. This problem becomes even more complicated if the tasks are not independent but are inte...