632 search results - page 62 / 127 » On the Approximability of the Steiner Tree Problem |
SPAA
1999
ACM
14 years 1 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
ECML
2006
Springer
14 years 16 days ago
2006
Springer
Abstract. Approximate Policy Iteration (API) is a reinforcement learning paradigm that is able to solve high-dimensional, continuous control problems. We propose to exploit API for...
SCAM
2007
IEEE
14 years 3 months ago
2007
IEEE
To encourage open source/libre software development, it is desirable to have tools that can help to identify open source license violations. This paper describes the implementatio...
CIKM
2006
Springer
14 years 18 days ago
2006
Springer
There has been a great amount of work on query-independent summarization of documents. However, due to the success of Web search engines query-specific document summarization (que...
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...