Sciweavers

2725 search results - page 202 / 545
» Constraint Solving for Interpolation
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 1 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
AI
2005
Springer
15 years 4 months ago
The distributed breakout algorithms
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
Katsutoshi Hirayama, Makoto Yokoo
ICASSP
2011
IEEE
14 years 8 months ago
Bounded gradient projection methods for sparse signal recovery
The 2- 1 sparse signal minimization problem can be solved efficiently by gradient projection. In many applications, the signal to be estimated is known to lie in some range of va...
James Hernandez, Zachary T. Harmany, Daniel Thomps...
ICCAD
2007
IEEE
86views Hardware» more  ICCAD 2007»
16 years 1 months ago
Stimulus generation for constrained random simulation
Constrained random simulation is the main workhorse in today’s hardware verification flows. It requires the random generation of input stimuli that obey a set of declaratively...
Nathan Kitchen, Andreas Kuehlmann
GLOBECOM
2009
IEEE
15 years 11 months ago
Joint Power and Channel Resource Allocation for F/TDMA Decode and Forward Relay Networks
—In this paper, we study the joint power and channel resource allocation problem for a multiuser F/TDMA decodeand-forward (DF) relay network under per-node power constraints and ...
Yin Sun, Yuanzhang Xiao, Ming Zhao 0001, Xiaofeng ...