Sciweavers

1522 search results - page 112 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
INFOCOM
2008
IEEE
14 years 3 months ago
Maximizing Resilient Throughput in Peer-to-Peer Network: A Generalized Flow Approach
—A unique challenge in P2P network is that the peer dynamics (departure or failure) cause unavoidable disruption to the downstream peers. While many works have been dedicated to ...
Bin Chang, Yi Cui, Yuan Xue
IAT
2006
IEEE
14 years 3 months ago
A Component-Based Architecture for Multi-Agent Systems
A Multi-agent system (MAS) is an open distributed system of agents. The agents in a MAS may form certain specific groups, where agents in each group jointly engage in solving a s...
Kaiyu Wan, Vasu S. Alagar
WIA
2005
Springer
14 years 2 months ago
Minimization of Non-deterministic Automata with Large Alphabets
There has been several attempts over the years to solve the bisimulation minimization problem for finite automata. One of the most famous algorithms is the one suggested by Paige ...
Parosh Aziz Abdulla, Johann Deneux, Lisa Kaati, Ma...
ICCAD
2000
IEEE
124views Hardware» more  ICCAD 2000»
14 years 1 months ago
A Methodology for Verifying Memory Access Protocols in Behavioral Synthesis
— Memory is one of the most important components to be optimized in the several phases of the synthesis process. ioral synthesis, a memory is viewed as an abstract construct whic...
Gernot Koch, Taewhan Kim, Reiner Genevriere
AUTOMATICA
2006
142views more  AUTOMATICA 2006»
13 years 9 months ago
Stability regions in the parameter space: D-decomposition revisited
The challenging problem in linear control theory is to describe the total set of parameters (controller coefficients or plant characteristics) which provide stability of a system....
Elena N. Gryazina, Boris T. Polyak