Sciweavers

1380 search results - page 125 / 276
» A General Polynomial Sieve
Sort
View
IPPS
2009
IEEE
14 years 4 months ago
Combining multiple heuristics on discrete resources
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
Marin Bougeret, Pierre-François Dutot, Alfr...
LICS
2009
IEEE
14 years 4 months ago
Logics with Rank Operators
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
Anuj Dawar, Martin Grohe, Bjarki Holm, Bastian Lau...
IMA
2009
Springer
111views Cryptology» more  IMA 2009»
14 years 4 months ago
Geometric Ideas for Cryptographic Equation Solving in Even Characteristic
Abstract. The GeometricXL algorithm is a geometrically invariant version of the XL algorithm that uses polynomials of a much smaller degree than either a standard Groebner basis al...
Sean Murphy, Maura B. Paterson
GLOBECOM
2008
IEEE
14 years 4 months ago
Impact of Constraints on the Complexity of Dynamic Spectrum Assignment
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
Chetan Nanjunda Mathur, Mohamed A. Haleem, Rajarat...
AAIM
2007
Springer
188views Algorithms» more  AAIM 2007»
14 years 4 months ago
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirot...