Sciweavers

1480 search results - page 228 / 296
» Ants can solve constraint satisfaction problems
Sort
View
TCAD
1998
86views more  TCAD 1998»
14 years 11 months ago
Fast heuristic and exact algorithms for two-level hazard-free logic minimization
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
Michael Theobald, Steven M. Nowick
ICASSP
2010
IEEE
15 years 1 days ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...
ICPR
2004
IEEE
16 years 29 days ago
A New Approach For The Registration of Images With Inconsistent Differences
In this paper, we focus on the Image Registration problem. Mathematically, this problem consists of minimizing an energy which is composed of a regularization term and a similarit...
Frédéric J. P. Richard
MOBIHOC
2006
ACM
15 years 11 months ago
Distributed localization using noisy distance and angle information
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Giri...
ATAL
2007
Springer
15 years 6 months ago
Commitment-driven distributed joint policy search
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
Stefan J. Witwicki, Edmund H. Durfee