Sciweavers

10392 search results - page 1813 / 2079
» Introduction to Computer Science
Sort
View
ESOP
2009
Springer
15 years 10 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
HOPL
2007
15 years 10 months ago
The development of the Emerald programming language
Emerald is an object-based programming language and system designed and implemented in the Department of Computer Science at the University of Washington in the early and mid-1980...
Andrew P. Black, Norman C. Hutchinson, Eric Jul, H...
CAISE
2004
Springer
15 years 10 months ago
Simple and Minimum-Cost Satisfiability for Goal Models
Abstract. Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a...
Roberto Sebastiani, Paolo Giorgini, John Mylopoulo...
156
Voted
ASSETS
2006
ACM
15 years 10 months ago
Loudmouth: : modifying text-to-speech synthesis in noise
Current speech synthesis technology is difficult to understand in everyday noise situations. Although there is a significant body of work on how humans modify their speech in nois...
Rupal Patel, Michael Everett, Eldar Sadikov
ATAL
2006
Springer
15 years 10 months ago
Monotonic concession protocols for multilateral negotiation
The most natural way of thinking about negotiation is probably a situation whereby each of the parties involved initially make a proposal that is particularly beneficial to themse...
Ulle Endriss
« Prev « First page 1813 / 2079 Last » Next »