Sciweavers

7796 search results - page 248 / 1560
» On Generalized Schur Numbers
Sort
View
WDAG
2009
Springer
130views Algorithms» more  WDAG 2009»
16 years 1 months ago
Contention-Sensitive Data Structures and Algorithms
A contention-sensitive data structure is a concurrent data structure in which the overhead introduced by locking is eliminated in the common cases, when there is no contention, or ...
Gadi Taubenfeld
163
Voted
MFCS
2009
Springer
16 years 1 months ago
The Longest Path Problem Is Polynomial on Interval Graphs
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
Kyriaki Ioannidou, George B. Mertzios, Stavros D. ...
MODELS
2009
Springer
16 years 1 months ago
Teaching Object-Oriented Modeling and UML to Various Audiences
This paper summarizes the experience of teaching objectoriented modeling and UML for more than a decade to various audiences (academic or corporate, software developers or not). W...
Sabine Moisan, Jean-Paul Rigault
UC
2009
Springer
16 years 1 months ago
On the Brightness of the Thomson Lamp: A Prolegomenon to Quantum Recursion Theory
Some physical aspects related to the limit operations of the Thomson lamp are discussed. Regardless of the formally unbounded and even infinite number of “steps” involved, the...
Karl Svozil
ICC
2007
IEEE
122views Communications» more  ICC 2007»
16 years 1 months ago
Dynamic Programming for Scheduling a Single Route in Wireless Networks
— Multi-slot resource scheduling in a general two dimensional wireless ad hoc network, is a hard problem with no known polynomial-time solution. Recent optimization theoretic ana...
Gyouhwan Kim, Rohit Negi