Sciweavers

8413 search results - page 379 / 1683
» Ordering Problem Subgoals
Sort
View
195
Voted
IJCAI
2003
15 years 8 months ago
Backdoors To Typical Case Complexity
There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can h...
Ryan Williams, Carla P. Gomes, Bart Selman
CORR
2008
Springer
77views Education» more  CORR 2008»
15 years 6 months ago
Energy-efficient Scheduling of Delay Constrained Traffic over Fading Channels
Abstract--A delay-constrained scheduling problem for pointto-point communication is considered: a packet of B bits must be transmitted by a hard deadline of T slots over a timevary...
Juyul Lee, Nihar Jindal
CORR
2006
Springer
128views Education» more  CORR 2006»
15 years 6 months ago
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). If, moreover, each vertex u V (D) is associated with costs ci(u), i...
Gregory Gutin, Arash Rafiey, Anders Yeo
EOR
2007
79views more  EOR 2007»
15 years 6 months ago
The directional p
An instance of a p-median problem gives n demand points. The objective is to locate p supply points in order to minimize the total distance of the demand points to their nearest s...
Laura E. Jackson, George N. Rouskas, Matthias F. M...
PRL
2006
98views more  PRL 2006»
15 years 6 months ago
Data complexity assessment in undersampled classification of high-dimensional biomedical data
Regularized linear classifiers have been successfully applied in undersampled, i.e. small sample size/high dimensionality biomedical classification problems. Additionally, a desig...
Richard Baumgartner, Ray L. Somorjai