4298 search results - page 448 / 860 » Measurable chromatic numbers |
161
click to vote
FOCS
1993
IEEE
15 years 11 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
220
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
193
click to vote
EDOC
2007
IEEE
15 years 11 months ago
2007
IEEE
The decentralized process of configuring enterprise applications is complex and error-prone, involving multiple participants/roles and numerous configuration changes across multipl...
169
click to vote
CONCUR
2006
Springer
15 years 10 months ago
2006
Springer
We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and ...
152
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...