2163 search results - page 130 / 433 » cases 2004 |
148
click to vote
RE
2004
Springer
15 years 10 months ago
2004
Springer
In this work, we propose a framework for quantifying non-functional requirements (NFRs). This framework uses quality characteristics of the execution domain, application domain an...
131
click to vote
RTA
2004
Springer
15 years 10 months ago
2004
Springer
The problem of selecting nodes in unranked trees is the most basic querying problem for XML. We propose stepwise tree automata for querying unranked trees. Stepwise tree automata c...
125
click to vote
SPATIALCOGNITION
2004
Springer
15 years 10 months ago
2004
Springer
We developed a method to analyze sketch maps by GIS, and applied it to an actual case study. We found that analysis using buffer operation was more effective for sketch map analyse...
121
click to vote
STACS
2004
Springer
15 years 10 months ago
2004
Springer
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
107
click to vote
STACS
2004
Springer
15 years 10 months ago
2004
Springer
d Abstract)⋆⋆ Daniel Kirsten LIAFA, Universit´e Denis Diderot – Case 7014, 2 place Jussieu, F-75251 Paris Cedex 05, France We give a positive solution to the so-called fini...