1998 search results - page 230 / 400 » Complexity of the Cover Polynomial |
208
click to vote
NJC
2006
15 years 6 months ago
2006
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
168
click to vote
SIGCSE
2008
ACM
15 years 6 months ago
2008
ACM
Providing consistent, instant, and detailed feedback to students has been a big challenge in teaching Web based computing, given the complexity of project assignments and the comp...
173
Voted
JDS
2007
15 years 6 months ago
2007
Operational Risk management, the least covered component of Enterprise Wide Risk Management, needs intelligent tools to implement Comprehensive Emergency Management Programs. In t...
174
click to vote
SIGCSE
2002
ACM
15 years 6 months ago
2002
ACM
Most courses on Discrete Mathematics are designed to emphasize problem solving, in general. When the goal is to cover the content, the learning and understanding takes a second pl...
176
click to vote
SAC
2008
ACM
15 years 6 months ago
2008
ACM
Test case prioritization for regression testing can be performed using different metrics (e.g., statement coverage, path coverage) depending on the application context. Employing ...