1537 search results - page 191 / 308 » On sets not belonging to algebras |
CP
1997
Springer
14 years 1 months ago
1997
Springer
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...
FOCS
1993
IEEE
14 years 1 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
EVOW
2007
Springer
14 years 28 days ago
2007
Springer
Abstract. Although important contributions have been made in recent years within the field of bioprocess model development and validation, in many cases the utility of even relativ...
CGO
2004
IEEE
14 years 24 days ago
2004
IEEE
Instruction scheduling hardware can be simplified and easily pipelined if pairs of dependent instructions are fused so they share a single instruction scheduling slot. We study an...
EUROPAR
2006
Springer
14 years 22 days ago
2006
Springer
Given current complexity of Grid technologies, the lack of security of P2P systems and the rigidity of VPN technologies make sharing resources belonging to different institutions s...