1199 search results - page 121 / 240 » Parameterized Proof Complexity |
88
Voted
DOCENG
2007
ACM
15 years 4 months ago
2007
ACM
We present a set of XML language extensions that bring notions from functional programming to web authors, extending the power of declarative modelling for the web. Our previous w...
108
Voted
ANTSW
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
AICCSA
2001
IEEE
15 years 4 months ago
2001
IEEE
The importance of early performance assessment grows as software systems increase in terms of size, logical distribution and interaction complexity. Lack of time from the side of ...
113
Voted
VLDB
1995
ACM
15 years 4 months ago
1995
ACM
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
102
click to vote
AOSD
2008
ACM
15 years 2 months ago
2008
ACM
Several aspect languages and frameworks have recognized the need for dynamic deployment of aspects. However, they do not provide sufficiently expressive means to precisely specify...