Sciweavers

934 search results - page 93 / 187
» A theoretical analysis of the HIFF problem
Sort
View
MFCS
2007
Springer
15 years 4 months ago
NP by Means of Lifts and Shadows
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
Gábor Kun, Jaroslav Nesetril
FOCS
2002
IEEE
15 years 2 months ago
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...
Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, M...
CAD
2006
Springer
14 years 10 months ago
Field modeling with sampled distances
Traditional mesh-based approaches to the modeling and analysis of physical fields within geometric models require some form of topological reconstruction and conversion in the mes...
Michael Freytag, Vadim Shapiro, Igor G. Tsukanov
VLSID
2002
IEEE
98views VLSI» more  VLSID 2002»
15 years 10 months ago
On Test Scheduling for Core-Based SOCs
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
Sandeep Koranne
NETCOOP
2007
Springer
15 years 4 months ago
Transit Prices Negotiation: Combined Repeated Game and Distributed Algorithmic Approach
— We present both a game theoretic and a distributed algorithmic approach for the transit price negotiation problem in the interdomain routing framework. We analyze the behavior ...
Dominique Barth, Johanne Cohen, Loubna Echabbi, Ch...