1772 search results - page 204 / 355 » Classifying Problems into Complexity Classes |
171
click to vote
SOFSEM
2007
Springer
16 years 16 days ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
149
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
173
click to vote
CAV
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
182
click to vote
ESORICS
1998
Springer
15 years 10 months ago
1998
Springer
When implementing a multilevel security policy for Object-Oriented Databases (OODBs), several aspects have to be investigated. One of these aspect is the design of multilevel OODB...
155
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...