16404 search results - page 881 / 3281 » A set coverage problem |
205
click to vote
HICSS
2003
IEEE
16 years 28 days ago
2003
IEEE
Inductive representation of conditional knowledge means to complete knowledge appropriately and can be looked upon as an instance of quite a general representation problem. The cr...
225
click to vote
AE
2003
Springer
16 years 26 days ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
179
click to vote
ATAL
2003
Springer
16 years 26 days ago
2003
Springer
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
189
click to vote
EUROGP
2003
Springer
16 years 26 days ago
2003
Springer
Finite state transducers (FSTs) are finite state machines that map strings in a source domain into strings in a target domain. While there are many reports in the literature of ev...
182
click to vote
EVOW
2010
Springer
16 years 23 days 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...