Sciweavers

644 search results - page 112 / 129
» Precedence Automata and Languages
Sort
View
ICALP
2011
Springer
12 years 12 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
AAAI
2011
12 years 8 months ago
On Expressing Value Externalities in Position Auctions
Externalities are recognized to exist in the sponsored search market, where two co-located ads compete for user attention. Existing work focuses on the effect of another ad on th...
Florin Constantin, Malvika Rao, Chien-Chung Huang,...
SOFSEM
2007
Springer
14 years 2 months ago
Deterministic Simulation of a NFA with k -Symbol Lookahead
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and ...
Bala Ravikumar, Nicolae Santean
FASE
2004
Springer
14 years 6 days ago
Specification and Analysis of Real-Time Systems Using Real-Time Maude
Real-Time Maude is a language and tool supporting the formal specification and analysis of real-time and hybrid systems. The specification formalism is based on rewriting logic, em...
Peter Csaba Ölveczky, José Meseguer
TON
2012
11 years 11 months ago
Scalable Lookahead Regular Expression Detection System for Deep Packet Inspection
—Regular expressions (RegExes) are widely used, yet their inherent complexity often limits the total number of RegExes that can be detected using a single chip for a reasonable t...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao