Sciweavers

1278 search results - page 218 / 256
» The Complexity of Weighted Boolean
Sort
View
GECCO
2006
Springer
220views Optimization» more  GECCO 2006»
14 years 1 months ago
Comparing evolutionary algorithms on the problem of network inference
In this paper, we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different evoluti...
Christian Spieth, Rene Worzischek, Felix Streicher...
AIPS
2010
14 years 18 days ago
Cost-Optimal Factored Planning: Promises and Pitfalls
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
Eric Fabre, Loig Jezequel, Patrik Haslum, Sylvie T...
AAAI
2007
14 years 18 days ago
Probabilistic Community Discovery Using Hierarchical Latent Gaussian Mixture Model
Complex networks exist in a wide array of diverse domains, ranging from biology, sociology, and computer science. These real-world networks, while disparate in nature, often compr...
Haizheng Zhang, C. Lee Giles, Henry C. Foley, John...
ATAL
2008
Springer
14 years 8 days ago
Nonuniform bribery
We study the concept of bribery in the situation where voters are willing to change their votes as we ask them, but where their prices depend on the nature of the change we reques...
Piotr Faliszewski
COMPGEOM
2005
ACM
14 years 7 days ago
Star splaying: an algorithm for repairing delaunay triangulations and convex hulls
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
Jonathan Richard Shewchuk