Sciweavers

2100 search results - page 180 / 420
» Fundamentals of the problem
Sort
View
ICPP
2006
IEEE
15 years 6 months ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri
99
Voted
ICMLA
2003
15 years 2 months ago
The Consolidation of Neural Network Task Knowledge
— Fundamental to the problem of lifelong machine learning is how to consolidate the knowledge of a learned task within a long-term memory structure (domain knowledge) without the...
Daniel L. Silver, Peter McCracken
TROB
2008
164views more  TROB 2008»
15 years 21 days ago
Dynamic Assignment in Distributed Motion Planning With Local Coordination
Distributed motion planning of multiple agents raises fundamental and novel problems in control theory and robotics. In particular, in applications such as coverage by mobile senso...
Michael M. Zavlanos, George J. Pappas
158
Voted
ICASSP
2009
IEEE
15 years 7 months ago
MIMO decoding based on stochastic reconstruction from multiple projections
Least squares (LS) fitting is one of the most fundamental techniques in science and engineering. It is used to estimate parameters from multiple noisy observations. In many probl...
Amir Leshem, Jacob Goldberger
CP
2004
Springer
15 years 6 months ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker