250 search results - page 44 / 50 » The complexity of temporal constraint satisfaction problems |
142
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
130
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
The process of creating e-learning contents using reusable learning objects (LOs) can be broken down in two sub-processes: LOs finding and LO sequencing. Sequencing is usually per...
151
click to vote
EDOC
2007
IEEE
15 years 8 months ago
2007
IEEE
The decentralized process of configuring enterprise applications is complex and error-prone, involving multiple participants/roles and numerous configuration changes across multipl...
132
click to vote
AIPS
2007
15 years 6 months ago
2007
We introduce the Linear Resource Temporal Network (LRTN), which consists of activities that consume or produce a resource, subject to absolute and relative metric temporal constra...
128
click to vote
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...