Sciweavers

415 search results - page 19 / 83
» Regular Processes and Timed Automata
Sort
View
IISWC
2008
IEEE
14 years 3 months ago
A workload for evaluating deep packet inspection architectures
—High-speed content inspection of network traffic is an important new application area for programmable networking systems, and has recently led to several proposals for high-per...
Michela Becchi, Mark A. Franklin, Patrick Crowley
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 6 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
TCS
2008
13 years 8 months ago
Kernel methods for learning languages
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
HYBRID
2000
Springer
14 years 10 days ago
Computing Optimal Operation Schemes for Chemical Plants in Multi-batch Mode
We propose a computer-aided methodology to automatically generate time optimal production schemes for chemical batch plants operating in multi-batch mode. Our approach is based on ...
Peter Niebert, Sergio Yovine
CMSB
2007
Springer
14 years 2 months ago
Context Sensitivity in Logical Modeling with Time Delays
For modeling and analyzing regulatory networks based on qualitative information and possibly additional temporal constraints, approaches using hybrid automata can be very helpful. ...
Heike Siebert, Alexander Bockmayr