2031 search results - page 192 / 407 » On Tree-Constrained Matchings and Generalizations |
74
Voted
DAGSTUHL
2008
15 years 3 days ago
2008
Abstract. We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size , using S...
SERVICES
2010
15 years 3 days ago
2010
In recent years, a number of approaches to semantic Web service matchmaking have been proposed. Most of these proposals are based on discrete and thus relatively coarse Degrees of...
ICWN
2008
15 years 3 days ago
2008
In our previous work, a highly scalable and faulttolerant network architecture, the Progressive Multi-hop Rotational Clustered (PMRC) structure, is proposed for constructing large...
IMECS
2007
15 years 3 days ago
2007
—In the context of multiple constant multiplications (MCM) design, we propose a novel common-subexpression-elimination (CSE) algorithm that models synthesis of coefficients into ...
AAAI
2006
15 years 2 days ago
2006
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of allowable computation time. The algorithm must then compute a solution within the ...