1469 search results - page 224 / 294 » Approximate polynomial decomposition |
134
click to vote
STACS
2004
Springer
15 years 11 months ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
169
click to vote
ICALP
1999
Springer
15 years 10 months ago
1999
Springer
The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and seve...
212
click to vote
FSTTCS
1993
Springer
15 years 10 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
196
click to vote
ALGOSENSORS
2007
Springer
15 years 10 months ago
2007
Springer
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
173
click to vote
AAAI
2004
15 years 7 months ago
2004
Neural-symbolic systems are hybrid systems that integrate symbolic logic and neural networks. The goal of neural-symbolic integration is to benefit from the combination of feature...