2103 search results - page 415 / 421 » Approximate Learning of Dynamic Models |
93
Voted
GLOBECOM
2009
IEEE
15 years 3 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...
111
click to vote
PPSN
2000
Springer
15 years 3 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...
103
click to vote
SDM
2007
SIAM
15 years 1 months 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...
109
Voted
FLAIRS
2004
15 years 1 months 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...
101
Voted
MVA
1994
15 years 29 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...