4335 search results - page 514 / 867 » Privatizing Constraint Optimization |
135
click to vote
COMPSAC
1996
IEEE
15 years 9 months ago
1996
IEEE
We present the architecture and design details of a logic database system that extends functionality in a number of ways. The system supports indefinite (non-Horn) facts in extens...
163
click to vote
ACML
2009
Springer
15 years 8 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...
133
click to vote
ASPDAC
2007
ACM
15 years 8 months ago
2007
ACM
The high performance requirements of networking applications has led to the advent of programmable network processor (NP) architectures that incorporate symmetric multiprocessing, ...
135
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
Routing in computer networks is a nonlinear combinatorial optimization problem with numerous constraints and is classified as an NP-complete problem. There are certain important Qo...
168
click to vote
DATE
2009
IEEE
15 years 8 months ago
2009
IEEE
This paper explores runtime reconfiguration of custom instructions in the context of multi-tasking real-time embedded systems. We propose a pseudo-polynomial time algorithm that mi...