467 search results - page 77 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
AIPS
2007
15 years 2 months ago
2007
We introduce the Linear Resource Temporal Network (LRTN), which consists of activities that consume or produce a resource, subject to absolute and relative metric temporal constra...
NIPS
2008
15 years 1 months ago
2008
Aiming towards the development of a general clustering theory, we discuss abstract axiomatization for clustering. In this respect, we follow up on the work of Kleinberg, ([1]) tha...
ESANN
2006
15 years 1 months ago
2006
Abstract. Response surfaces are a powerful tool for both classification and regression as they are able to model many different phenomena and construct complex boundaries between c...
101
Voted
GECCO
2008
Springer
15 years 25 days ago
2008
Springer
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
115
click to vote
ATAL
2010
Springer
15 years 26 days ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...