Sciweavers

22 search results - page 2 / 5
» A heuristic-based framework to solve a complex aircraft sizi...
Sort
View
ANTSW
2006
Springer
13 years 9 months ago
Kernelization as Heuristic Structure for the Vertex Cover Problem
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
Stephen Gilmour, Mark Dras
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
13 years 10 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
ASIACRYPT
2008
Springer
13 years 7 months ago
Generalized Identity Based and Broadcast Encryption Schemes
Abstract. We provide a general framework for constructing identitybased and broadcast encryption systems. In particular, we construct a general encryption system called spatial enc...
Dan Boneh, Michael Hamburg
PAMI
2008
155views more  PAMI 2008»
13 years 4 months ago
Subclass Problem-Dependent Design for Error-Correcting Output Codes
A common way to model multiclass classification problems is by means of Error-Correcting Output Codes (ECOCs). Given a multiclass problem, the ECOC technique designs a code word fo...
Sergio Escalera, David M. J. Tax, Oriol Pujol, Pet...
FOCS
2007
IEEE
13 years 11 months ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx