Sciweavers

259 search results - page 18 / 52
» Some New Directions and Questions in Parameterized Complexit...
Sort
View
CC
2003
Springer
14 years 22 days ago
Early Control of Register Pressure for Software Pipelined Loops
Abstract. The register allocation in loops is generally performed after or during the software pipelining process. This is because doing a conventional register allocation at firs...
Sid Ahmed Ali Touati, Christine Eisenbeis
FUN
2007
Springer
78views Algorithms» more  FUN 2007»
14 years 1 months ago
Wooden Geometric Puzzles: Design and Hardness Proofs
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
Helmut Alt, Hans L. Bodlaender, Marc J. van Krevel...
ANCS
2010
ACM
13 years 5 months ago
A new TCB cache to efficiently manage TCP sessions for web servers
TCP/IP, the most commonly used network protocol, consumes a significant portion of time in Internet servers. While a wide spectrum of studies has been done to reduce its processin...
Guangdeng Liao, Laxmi N. Bhuyan, Wei Wu, Heeyeol Y...
ICALP
2010
Springer
13 years 9 months ago
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
Gossip protocols, also known as epidemic dissemination schemes, are becoming increasingly popular in distributed systems. Yet, it has remained a partially open question to determin...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Mort...
ECAI
2006
Springer
13 years 11 months ago
Resolving Conflicts in Action Descriptions
Abstract. We study resolving conflicts between an action description and a set of conditions (possibly obtained from observations), in the context of action languages. In this form...
Thomas Eiter, Esra Erdem, Michael Fink, Ján...