Sciweavers

644 search results - page 119 / 129
» Graph structured program evolution
Sort
View
LICS
1997
IEEE
15 years 3 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
LREC
2010
144views Education» more  LREC 2010»
15 years 1 months ago
Evaluating Complex Semantic Artifacts
Evaluating complex Natural Language Processing (NLP) systems can prove extremely difficult. In many cases, the best one can do is to evaluate these systems indirectly, by looking ...
Christopher R. Walker, Hannah Copperman
MASCOTS
2003
15 years 1 months ago
A Packet-Level Simulation Study of Optimal Web Proxy Cache Placement
The Web proxy cache placement problem is often formulated as a classical optimization problem: place N proxies within an internetwork so as to minimize the average user response t...
Gwen Houtzager, Carey L. Williamson
PDSE
2000
86views more  PDSE 2000»
15 years 1 months ago
A Principled Approach to Supporting Adaptation in Distributed Mobile Environments
To support multimedia applications in mobile environments, it will be necessary for applications to be aware of the underlying environmental conditions, and also to be able to ada...
Gordon S. Blair, Geoff Coulson, Anders Andersen, L...
NRHM
2008
106views more  NRHM 2008»
14 years 11 months ago
Towards the unification of formats for overlapping markup
Overlapping markup refers to the issue of how to represent data structures more expressive than trees--for example direct acyclic graphs--using markup (meta-)languages which have ...
Paolo Marinelli, Fabio Vitali, Stefano Zacchiroli