305 search results - page 34 / 61 » Decidability of Split Equivalence |
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
MATES
2009
Springer
14 years 2 months ago
2009
Springer
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
FOCS
1997
IEEE
13 years 12 months ago
1997
IEEE
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
EUROGP
2010
Springer
13 years 9 months ago
2010
Springer
We propose a new framework based on Genetic Programming (GP) to automatically decompose problems into smaller and simpler tasks. The framework uses GP at two levels. At the top lev...
CONEXT
2008
ACM
13 years 9 months ago
2008
ACM
Networked Virtual Environments (NVEs) are computer generated, synthetic worlds that allow simultaneous interactions of multiple participants. IP multicast and application layer mu...