418 search results - page 74 / 84 » A relaxation-based algorithm for solving the conditional p-c... |
SPAA
2004
ACM
14 years 29 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
—The multi-source and single-sink (MSSS) topology, in wireless sensor networks, is defined as the network topology, where all of nodes can gather, receive and transmit data to t...
PASTE
2004
ACM
14 years 29 days ago
2004
ACM
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
ECP
1997
Springer
13 years 11 months ago
1997
Springer
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
In the realm of data mining, several key issues exists in the traditional classification algorithms, such as low readability, large rule number, and low accuracy with information ...