Sciweavers

20126 search results - page 173 / 4026
» Timed Transition Systems
Sort
View
130
Voted
WG
2004
Springer
15 years 9 months ago
Treelike Comparability Graphs: Characterization, Recognition, and Applications
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
Sabine Cornelsen, Gabriele Di Stefano
131
Voted
EPS
1998
Springer
15 years 7 months ago
Evolutionary Search for Minimal Elements in Partially Ordered Finite Sets
The task of finding minimal elements of a partially ordered set is a generalization of the task of finding the global minimum of a real-valued function or of finding Pareto-optimal...
Günter Rudolph
112
Voted
CONEXT
2007
ACM
15 years 7 months ago
Can we reduce Wi-Fi energy consumption during VoIP calls?
In this paper we examine if any energy savings are possible by letting the Wireless LAN interface transition to sleep mode during a VoIP call considering the real time nature of v...
Vinod Namboodiri, Lixin Gao
167
Voted
COMBINATORICS
2006
169views more  COMBINATORICS 2006»
15 years 3 months ago
The Diameter and Laplacian Eigenvalues of Directed Graphs
For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly con...
Fan R. K. Chung
99
Voted
CORR
2010
Springer
58views Education» more  CORR 2010»
15 years 1 months ago
Towards Theory of Massive-Parallel Proofs. Cellular Automata Approach
In the paper I sketch a theory of massively parallel proofs using cellular automata presentation of deduction. In this presentation inference rules play the role of cellular-autom...
Andrew Schumann