3946 search results - page 508 / 790 » The computational complexity of choice sets |
177
click to vote
ADHOCNOW
2008
Springer
16 years 1 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
195
click to vote
CONCUR
2007
Springer
16 years 28 days ago
2007
Springer
The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imp...
259
click to vote
DSOM
2007
Springer
16 years 27 days ago
2007
Springer
Web Services are an XML technology recently viewed as capable of being used for network management. A key aspect of WS in this domain is event reporting. WS-based research in this ...
177
Voted
GECCO
2007
Springer
16 years 27 days ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
176
click to vote
ISVC
2007
Springer
16 years 27 days ago
2007
Springer
Resource allocation in ad hoc communication networks is a field of high complexity because of both i) the distributed nature of the interactions between the nodes, and ii) the lar...