1197 search results - page 46 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
159
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
This paper concerns the reconstruction of a temporally-varying scene from a video sequence of noisy linear projections. Assuming that each video frame is sparse or compressible in...
184
click to vote
AAAI
2010
15 years 7 months ago
2010
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
150
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
In this paper, we consider a cognitive radio (CR) network in which the unlicensed (secondary) users are allowed to concurrently access the spectrum allocated to the licensed (prim...
176
click to vote
ICIP
1999
IEEE
16 years 7 months ago
1999
IEEE
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...
191
click to vote
DAC
2000
ACM
16 years 6 months ago
2000
ACM
In this paper, we introduce a new technique for modeling and solving the dynamic power management (DPM) problem for systems with complex behavioral characteristics such as concurr...