1332 search results - page 120 / 267 » Combinatorial Algorithms |
154
click to vote
OTM
2005
Springer
15 years 11 months ago
2005
Springer
A composition arranges available services resulting in a defined flow of executions. Before the composition is carried out, a discovery service identifies candidate services. Th...
152
click to vote
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
197
click to vote
AAAI
2000
15 years 7 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
153
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
177
click to vote
ENDM
2010
15 years 6 months ago
2010
Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a "big&quo...