699 search results - page 75 / 140 » The method of combinatorial telescoping |
175
click to vote
DAC
1996
ACM
15 years 10 months ago
1996
ACM
Abstract -- This paper introduces a new HW/SW partitioning algorithm used in automating the instruction set processor design for pipelined ASIP (Application Specific Integrated Pro...
152
click to vote
ISSAC
1997
Springer
15 years 10 months ago
1997
Springer
Computer algebra systems typically drop some degenerate cases when evaluating expressions, e.g., x=x becomes 1 dropping the case x = 0. We claim that it is feasible in practice to...
147
click to vote
ICPP
1989
IEEE
15 years 10 months ago
1989
IEEE
We examine computing alternative solutions to a problem in parallel to improve response time. Problems with exploring multiple alternatives in parallel include (1) side-effects an...
191
click to vote
ACML
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
159
click to vote
GECCO
2010
Springer
15 years 10 months ago
2010
Springer
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...