Sciweavers

266 search results - page 47 / 54
» Solving Very Large Crew Scheduling Problems to Optimality
Sort
View
IPSN
2010
Springer
14 years 5 months ago
Online distributed sensor selection
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
Daniel Golovin, Matthew Faulkner, Andreas Krause
ICDCS
1999
IEEE
14 years 3 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
CONSTRAINTS
1998
127views more  CONSTRAINTS 1998»
13 years 10 months ago
Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Malek Mouhoub, François Charpillet, Jean Pa...
ICCV
2011
IEEE
12 years 11 months ago
The Power of Comparative Reasoning
Rank correlation measures are known for their resilience to perturbations in numeric values and are widely used in many evaluation metrics. Such ordinal measures have rarely been ...
Jay Yagnik, Dennis Strelow, David Ross, Ruei-sung ...
EVOW
2007
Springer
14 years 5 months ago
An Adaptive Global-Local Memetic Algorithm to Discover Resources in P2P Networks
This paper proposes a neural network based approach for solving the resource discovery problem in Peer to Peer (P2P) networks and an Adaptive Global Local Memetic Algorithm (AGLMA)...
Ferrante Neri, Niko Kotilainen, Mikko Vapa