Sciweavers

3082 search results - page 277 / 617
» New Bounds for the Controller Problem
Sort
View
147
Voted
ICALP
2005
Springer
16 years 5 days ago
Quantum Complexity of Testing Group Commutativity
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
Frédéric Magniez, Ashwin Nayak
ISW
2000
Springer
15 years 10 months ago
A Signcryption Scheme Based on Integer Factorization
Abstract. Signcryption is a public-key cryptographic primitive introduced by Zheng, which achieves both message confidentiality and nonrepudiatable origin authenticity, at a lower ...
Ron Steinfeld, Yuliang Zheng
AAAI
1996
15 years 8 months ago
A Graph-Based Method for Improving GSAT
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
Kalev Kask, Rina Dechter
TAMC
2010
Springer
15 years 5 months ago
Two-Layer Planarization Parameterized by Feedback Edge Set
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
Johannes Uhlmann, Mathias Weller
WEA
2010
Springer
241views Algorithms» more  WEA 2010»
16 years 1 months ago
A Branch-and-Price Algorithm for Multi-mode Resource Leveling
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
Eamonn T. Coughlan, Marco E. Lübbecke, Jens S...