Sciweavers

18306 search results - page 196 / 3662
» Algorithmics in Exponential Time
Sort
View
COCO
2007
Springer
126views Algorithms» more  COCO 2007»
15 years 8 months ago
On Derandomizing Probabilistic Sublinear-Time Algorithms
There exists a positive constant α < 1 such that for any function T(n) ≤ nα and for any problem L ∈ BPTIME(T(n)), there exists a deterministic algorithm running in poly(T...
Marius Zimand
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
15 years 2 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
ML
2000
ACM
185views Machine Learning» more  ML 2000»
15 years 2 months ago
A Comparison of Prediction Accuracy, Complexity, and Training Time of Thirty-Three Old and New Classification Algorithms
Twenty-two decision tree, nine statistical, and two neural network algorithms are compared on thirty-two datasets in terms of classification accuracy, training time, and (in the ca...
Tjen-Sien Lim, Wei-Yin Loh, Yu-Shan Shih
ICPADS
2005
IEEE
15 years 8 months ago
A Configurable Time-Controlled Clustering Algorithm for Wireless Sensor Networks
Future large-scale sensor networks may comprise thousands of wirelessly connected sensor nodes that could provide an unimaginable opportunity to interact with physical phenomena i...
S. Selvakennedy, Sukunesan Sinnappan