1816 search results - page 42 / 364 » A New Approach for Solving the Maximum Clique Problem |
CP
2006
Springer
15 years 3 months ago
2006
Springer
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
ISBI
2008
IEEE
16 years 17 days ago
2008
IEEE
A new method for estimating multivariate autoregressive (MVAR) models of cortical connectivity from surface EEG or MEG measurements is presented. Conventional approaches to this p...
DAC
1995
ACM
15 years 3 months ago
1995
ACM
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
TASE
2008
IEEE
14 years 11 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
116
click to vote
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...