14548 search results - page 2486 / 2910 » The Optimal Path-Matching Problem |
223
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
We show how a random mutation hill climber that does multilevel selection utilizes transposition to escape local optima on the discrete Hierarchical-If-And-Only-If (HIFF) problem....
236
click to vote
IPSN
2007
Springer
16 years 29 days ago
2007
Springer
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
220
click to vote
TACAS
2007
Springer
16 years 28 days ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
208
click to vote
COMSWARE
2006
IEEE
16 years 27 days ago
2006
IEEE
— Development in new radio technologies and increase in user demands are driving the deployment of a wide array of wireless networks, ranging from 802.11 networks in the local ar...
222
click to vote
PODC
2006
ACM
16 years 24 days ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...