520 search results - page 45 / 104 » Reductions Between Expansion Problems |
CG
1998
Springer
14 years 1 months ago
1998
Springer
Humans can e ectively navigate through large search spaces, enabling them to solve problems with daunting complexity. This is largely due to an ability to successfully distinguish ...
WSC
2008
13 years 11 months ago
2008
Event based simulations are an important scientific application in many fields. With the rise of cluster computing, distributed event simulation optimization becomes an essential ...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
We consider the problem of transmitting data at rate R over a state dependent channel p(ylx, s) with the state information available at the sender and at the same time conveying th...
SPAA
2003
ACM
14 years 2 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
IPL
2008
13 years 8 months ago
2008
Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongl...