1453 search results - page 220 / 291 » Partial Constraint Satisfaction |
DAGSTUHL
2008
15 years 1 months ago
2008
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...
102
click to vote
TCS
2008
14 years 11 months ago
2008
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
NAACL
2010
14 years 9 months ago
2010
Extraction of entities from ad creatives is an important problem that can benefit many computational advertising tasks. Supervised and semi-supervised solutions rely on labeled da...
106
click to vote
IJAR
2011
14 years 3 months ago
2011
The basic idea of an algebraic approach to learning Bayesian network (BN) structures is to represent every BN structure by a certain uniquely determined vector, called the standar...
86
Voted
SIGSOFT
2008
ACM
16 years 18 days ago
2008
ACM
Getting the right software requirements under the right environment assumptions is a critical precondition for developing the right software. This task is intrinsically difficult....