2988 search results - page 59 / 598 » Experiments with a New Boosting Algorithm |
135
click to vote
TASE
2008
IEEE
15 years 4 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 ...
144
click to vote
DOLAP
2000
ACM
15 years 9 months ago
2000
ACM
Being able to efficiently answer arbitrary OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes has been a continued, major co...
121
Voted
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
128
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Radio network design (RND) is a fundamental problem in cellular networks for telecommunications. In these networks, the terrain must be covered by a set of base stations (or anten...
205
click to vote
WEA
2010
Springer
15 years 11 months ago
2010
Springer
We present a new Feasibility Pump algorithm tailored for nonconvex Mixed Integer Nonlinear Programming problems. Differences with the previously proposed Feasibility Pump algorith...