4345 search results - page 202 / 869 » Temporal Constraint Networks |
176
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
A sequential quadratic programming (SQP) method is proposed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization ...
158
click to vote
ICMI
2000
Springer
15 years 9 months ago
2000
Springer
Inferring users' actions and intentions forms an integral part of design and development of any human-computer interface. The presence of noisy and at times ambiguous sensory ...
160
click to vote
CP
2000
Springer
15 years 10 months ago
2000
Springer
plexity Theorems: Talk Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 David McAllester Regular Papers Automatic Generation of Propagation Rules for F...
166
click to vote
ECML
2005
Springer
15 years 11 months ago
2005
Springer
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
156
click to vote
CP
2008
Springer
15 years 7 months ago
2008
Springer
We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE...