11740 search results - page 337 / 2348 » More Problems in Rewriting |
159
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
170
click to vote
CCS
2007
ACM
16 years 26 days ago
2007
ACM
Researchers have previously looked into the problem of determining if a given set of security hardening measures can effectively make a networked system secure. Many of them also...
167
click to vote
EUROGP
2007
Springer
16 years 26 days ago
2007
Springer
The ability of Genetic Programming to scale to problems of increasing difficulty operates on the premise that it is possible to capture regularities that exist in a problem environ...
209
click to vote
APPROX
2005
Springer
16 years 7 days ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
165
click to vote
OTM
2005
Springer
16 years 5 days ago
2005
Springer
A composition arranges available services resulting in a defined flow of executions. Before the composition is carried out, a discovery service identifies candidate services. Th...