Sciweavers

10 search results - page 2 / 2
» The Generating Power of Total Deterministic Tree Transducers
Sort
View
ACL
1992
13 years 7 months ago
Linear Context-Free Rewriting Systems and Deterministic Tree-Walking Transducers
We show that the class of string languages generated by linear context-free rewriting systems is equal to the class of output languages of deterministic treewalking transducers. F...
David J. Weir
TCIAIG
2010
13 years 21 days ago
The Parametrized Probabilistic Finite-State Transducer Probe Game Player Fingerprint Model
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...
Jeffrey Tsang
DAC
2006
ACM
14 years 7 months ago
Harvesting aware power management for sensor networks
Energy harvesting offers a promising alternative to solve the sustainability limitations arising from battery size constraints in sensor networks. Several considerations in using ...
Aman Kansal, Jason Hsu, Mani B. Srivastava, Vijay ...
COMPGEOM
1992
ACM
13 years 10 months ago
On-Line Steiner Trees in the Euclidean Plane
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
Noga Alon, Yossi Azar
INFORMATICALT
2010
101views more  INFORMATICALT 2010»
13 years 4 months ago
An Improved Differential Evolution Scheme for the Solution of Large-Scale Unit Commitment Problems
This paper presents an improved differential evolution (IDE) method for the solution of large-scale unit commitment (UC) problems. The objective of the proposed scheme is to determ...
Chen-Sung Chang