2899 search results - page 171 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
160
click to vote
RSS
2007
15 years 7 months ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
161
click to vote
INFOCOM
2007
IEEE
16 years 13 days ago
2007
IEEE
— The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...
266
click to vote
GECCO
2007
Springer
16 years 9 days ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
157
Voted
HIPC
2004
Springer
15 years 11 months ago
2004
Springer
This paper summarizes the design and implementation of a parallel algorithm for state assignment of large Finite State Machines (FSMs). High performance CAD tools are necessary to...
138
click to vote
INFOCOM
1997
IEEE
15 years 10 months ago
1997
IEEE
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...