Sciweavers

4428 search results - page 93 / 886
» The Chow Parameters Problem
Sort
View
CATA
2004
15 years 4 months ago
Optimal Trees for the Parametric Fixed Charge Shortest Paths Problem
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
Fred J. Rispoli, Steven Cosares
98
Voted
AAAI
1998
15 years 4 months ago
Which Search Problems Are Random?
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
Tad Hogg
122
Voted
FLAIRS
2006
15 years 4 months ago
Genetic Programming: Analysis of Optimal Mutation Rates in a Problem with Varying Difficulty
In this paper we test whether a correlation exists between the optimal mutation rate and problem difficulty. We find that the range of optimal mutation rates is inversely proporti...
Alan Piszcz, Terence Soule
143
Voted
NIPS
2004
15 years 4 months ago
Learning, Regularization and Ill-Posed Inverse Problems
Many works have shown that strong connections relate learning from examples to regularization techniques for ill-posed inverse problems. Nevertheless by now there was no formal ev...
Lorenzo Rosasco, Andrea Caponnetto, Ernesto De Vit...
JOIN
2007
133views more  JOIN 2007»
15 years 3 months ago
The Coverage Problem in Three-Dimensional Wireless Sensor Networks
— One of the fundamental issues in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formul...
Chi-Fu Huang, Yu-Chee Tseng, Li-Chu Lo