16504 search results - page 290 / 3301 » New Problems, New Solutions |
224
click to vote
SAC
2003
ACM
16 years 21 days ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
183
click to vote
ERCIMDL
2004
Springer
16 years 26 days ago
2004
Springer
In maintaining Digital Libraries, having bibliographic data up-to-date is critical, yet often minor irregularities may cause information isolation. Unlike documents for which vario...
141
Voted
NIPS
2000
15 years 8 months ago
2000
For many problems which would be natural for reinforcement learning, the reward signal is not a single scalar value but has multiple scalar components. Examples of such problems i...
166
click to vote
ASE
2007
15 years 7 months ago
2007
This paper surveys a selection of personal research projects which addressed problems related to Software Engineering, and whose solution was inspired by ideas from the field of K...
191
click to vote
AAAI
1992
15 years 8 months ago
1992
We propose a representation of concurrent actions; rather than invent a new formalism, we model them within the standard situation calculus by introducing the notions of global ac...