13603 search results - page 282 / 2721 » On the Computational Complexity of Cut-Reduction |
165
click to vote
IEICET
2006
15 years 6 months ago
2006
Abstract--We propose several heuristic algorithms that reconfigure logical topologies in wide-area wavelength-routed optical networks. Our reconfiguration algorithms attempt to kee...
130
click to vote
IPL
2008
15 years 6 months ago
2008
We prove that on prefix-recognizable graphs reachability is complete for deterministic exponential time matching the complexity of alternating reachability. Key words: Reachabilit...
190
click to vote
CIE
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
254
click to vote
MIDDLEWARE
2010
Springer
15 years 5 months ago
2010
Springer
Enterprise distributed real-time and embedded (DRE) publish/subscribe (pub/sub) systems manage resources and data that are vital to users. Cloud computing—where computing resourc...
208
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Computational social choice is an interdisciplinary eld of study at the interface of social choice theory and computer science, with knowledge owing in either direction. On the o...