Sciweavers

16843 search results - page 323 / 3369
» On Generalized Authorization Problems
Sort
View
CSL
2010
Springer
15 years 7 months ago
On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
Yijia Chen, Jörg Flum
COMPUTING
2007
78views more  COMPUTING 2007»
15 years 6 months ago
Calculating lower bounds for caching problems
We present a general method for computing lower bounds for various caching problems. We apply the method to two well known problems, companion caching and weighted caching. For we...
Leah Epstein, Rob van Stee
COR
2008
133views more  COR 2008»
15 years 6 months ago
A new constraint programming approach for the orthogonal packing problem
The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set of rectangles can be packed in a larger rectangle of fixed size. We propose an exact method ...
François Clautiaux, Antoine Jouglet, Jacque...
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
15 years 1 months ago
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
CEC
2005
IEEE
16 years 8 days ago
An ant algorithm hyperheuristic for the project presentation scheduling problem
Abstract- Ant algorithms have generated significant research interest within the search/optimisation community in recent years. Hyperheuristic research is concerned with the devel...
Edmund K. Burke, Graham Kendall, Dario Landa Silva...