Sciweavers

491 search results - page 1 / 99
» Avoiding Determinization
Sort
View
86
Voted
LICS
2006
IEEE
15 years 6 months ago
Avoiding Determinization
Automata on infinite objects are extensively used in system specification, verification, and synthesis. While some applications of the automata-theoretic approach have been wel...
Orna Kupferman
EJC
2007
15 years 8 days ago
Online balanced graph avoidance games
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
Martin Marciniszyn, Dieter Mitsche, Milos Stojakov...
ENDM
2002
107views more  ENDM 2002»
15 years 3 days ago
Edge-Colorings of Complete Graphs that Avoid Polychromatic Trees
Given a positive integer n and a family F of graphs, let R(n, F) denote the maximum number of colors in an edge-coloring of Kn such that no subgraph of Kn belonging to F has disti...
Tao Jiang, Douglas B. West
ICRA
2003
IEEE
128views Robotics» more  ICRA 2003»
15 years 5 months ago
Avoiding unsafe states in manufacturing systems based on polynomial digraph algorithms
Abstract − A deadlock-free unsafe (DFU) state of Resource Allocation System (RAS) is deadlock-free but inevitable to enter a deadlock state. Previous research revealed that in ma...
Yin Wang, Zhiming Wu
ISMB
1994
15 years 1 months ago
Neural Networks for Determining Protein Specificity and Multiple Alignment of Binding Sites
Weuse a quantitative definition of specificity to developa neural networkfor the identification of commonprotein binding sites in a collection of unaligned DNAfragments. Wedemonst...
John M. Heumann, Alan S. Lapedes, Gary D. Stormo