2103 search results - page 415 / 421 » Approximate Learning of Dynamic Models |
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
We investigate an optimal scheduling problem in a discrete-time system of L parallel queues that are served by K identical servers. This model has been widely used in studies of em...
PPSN
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
SDM
2007
SIAM
14 years 9 days ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
FLAIRS
2004
14 years 8 days ago
2004
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfacti...
MVA
1994
14 years 6 days ago
1994
Amethod is developed to identifya taxiing airplane and measure its position correctly under various lighting and weather conditionsby inputting a moving image from an adaptively-co...