Sciweavers

332 search results - page 49 / 67
» Parameterized Graph Separation Problems
Sort
View
FPGA
1997
ACM
145views FPGA» more  FPGA 1997»
13 years 11 months ago
Generation of Synthetic Sequential Benchmark Circuits
Programmable logic architectures increase in capacity before commercial circuits are designed for them, yielding a distinct problem for FPGA vendors: how to test and evaluate the ...
Michael D. Hutton, Jonathan Rose, Derek G. Corneil
AAAI
2010
13 years 8 months ago
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments
We present a fast local search algorithm that finds an improved solution (if there is any) in the k-exchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
LCC
1994
248views Algorithms» more  LCC 1994»
13 years 11 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin
CORR
2008
Springer
179views Education» more  CORR 2008»
13 years 7 months ago
Distributed Parameter Estimation in Sensor Networks: Nonlinear Observation Models and Imperfect Communication
The paper studies the problem of distributed static parameter (vector) estimation in sensor networks with nonlinear observation models and imperfect inter-sensor communication. We...
Soummya Kar, José M. F. Moura, Kavita Raman...
MFCS
2004
Springer
14 years 22 days ago
A Protocol for Serializing Unique Strategies
Abstract. We devise an efficient protocol by which a series of twoperson games Gi with unique winning strategies can be combined into a single game G with unique winning strategy, ...
Marcel Crâsmaru, Christian Glaßer, Ken...