3229 search results - page 394 / 646 » The Theory of Timed Automata |
154
click to vote
ATAL
2007
Springer
16 years 28 days ago
2007
Springer
Interdependent values (IDV) is a valuation model allowing bidders in an auction to express their value for the item(s) to sell as a function of the other bidders’ information. W...
140
Voted
ESA
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid rep...
154
click to vote
FSTTCS
2007
Springer
16 years 27 days ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
158
click to vote
GECCO
2007
Springer
16 years 27 days ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
176
Voted
ICALP
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...