Sciweavers

1651 search results - page 270 / 331
» Measuring the Complexity of Classification Problems
Sort
View
IPSN
2010
Springer
14 years 10 days ago
Practical modeling and prediction of radio coverage of indoor sensor networks
The robust operation of many sensor network applications depends on deploying relays to ensure wireless coverage. Radio mapping aims to predict network coverage based on a small n...
Octav Chipara, Gregory Hackmann, Chenyang Lu, Will...
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
14 years 2 months ago
Screening the parameters affecting heuristic performance
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
Enda Ridge, Daniel Kudenko
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
14 years 14 days ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
AAAI
1993
13 years 9 months ago
On the Adequateness of the Connection Method
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
Antje Beringer, Steffen Hölldobler
ALT
2003
Springer
14 years 12 hour ago
Efficiently Learning the Metric with Side-Information
Abstract. A crucial problem in machine learning is to choose an appropriate representation of data, in a way that emphasizes the relations we are interested in. In many cases this ...
Tijl De Bie, Michinari Momma, Nello Cristianini