Sciweavers

923 search results - page 166 / 185
» On a generalization of Stickelberger's Theorem
Sort
View
126
Voted
DLS
2009
196views Languages» more  DLS 2009»
14 years 7 months ago
Contracts for first-class modules
Behavioral software contracts express properties concerning the flow of values across component (modules, classes, etc) interfaces. These properties are often beyond the reach of ...
T. Stephen Strickland, Matthias Felleisen
70
Voted
ALGORITHMS
2010
113views more  ALGORITHMS 2010»
14 years 7 months ago
A Complete Theory of Everything (Will Be Subjective)
Increasingly encompassing models have been suggested for our world. Theories range from generally accepted to increasingly speculative to apparently bogus. The progression of theo...
Marcus Hutter
CEC
2010
IEEE
14 years 6 months ago
Differential evolution with ensemble of constraint handling techniques for solving CEC 2010 benchmark problems
Several constraint handling techniques have been proposed to be used with the evolutionary algorithms (EAs). According to the no free lunch theorem, it is impossible for a single c...
Rammohan Mallipeddi, Ponnuthurai Nagaratnam Sugant...
STACS
2010
Springer
15 years 4 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
15 years 4 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman