6348 search results - page 769 / 1270 » A Lesson for Software Engineering from Knowledge Engineering |
164
click to vote
FOSSACS
2004
Springer
16 years 8 days ago
2004
Springer
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the m...
205
click to vote
ICWE
2004
Springer
16 years 8 days ago
2004
Springer
The Semantic Web will allow software agents to understand and reason about data provided by Web applications. Unfortunately, formal ontologies, needed to express data semantics, ar...
207
click to vote
SIAMCOMP
2011
14 years 9 months ago
2011
The Gibbard-Satterthwaite theorem states that every non-dictatorial election rule among at least three alternatives can be strategically manipulated. We prove a quantitative versi...
205
click to vote
BPM
2006
Springer
15 years 10 months ago
2006
Springer
Complexity has undesirable effects on, among others, the correctness, maintainability, and understandability of business process models. Yet, measuring complexity of business proce...
168
click to vote
SIGSOFT
2007
ACM
16 years 7 months ago
2007
ACM
In this paper, we propose a technique for leveraging historical field failure records in conjunction with automated static analysis alerts to determine which alerts or sets of ale...