Sciweavers

520 search results - page 48 / 104
» New Complexity Results for Classical Planning Benchmarks
Sort
View
COR
2008
102views more  COR 2008»
13 years 8 months ago
An algorithm for ranking assignments using reoptimization
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...
Christian Roed Pedersen, Lars Relund Nielsen, Kim ...
DATE
2003
IEEE
116views Hardware» more  DATE 2003»
14 years 1 months ago
Statistical Timing Analysis Using Bounds
The growing impact of within-die process variation has created the need for statistical timing analysis, where gate delays are modeled as random variables. Statistical timing anal...
Aseem Agarwal, David Blaauw, Vladimir Zolotov, Sar...
SDM
2008
SIAM
150views Data Mining» more  SDM 2008»
13 years 10 months ago
A Stagewise Least Square Loss Function for Classification
This paper presents a stagewise least square (SLS) loss function for classification. It uses a least square form within each stage to approximate a bounded monotonic nonconvex los...
Shuang-Hong Yang, Bao-Gang Hu
ALGORITHMICA
2004
112views more  ALGORITHMICA 2004»
13 years 8 months ago
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...
Anne Berry, Jean R. S. Blair, Pinar Heggernes, Bar...
ATAL
2009
Springer
14 years 3 months ago
Improving adjustable autonomy strategies for time-critical domains
As agents begin to perform complex tasks alongside humans as collaborative teammates, it becomes crucial that the resulting humanmultiagent teams adapt to time-critical domains. I...
Nathan Schurr, Janusz Marecki, Milind Tambe