Sciweavers

4378 search results - page 295 / 876
» On the Complexity of Ordered Colourings
Sort
View
SIGSOFT
2008
ACM
16 years 7 months ago
Javert: fully automatic mining of general temporal properties from dynamic traces
Program specifications are important for many tasks during software design, development, and maintenance. Among these, temporal specifications are particularly useful. They expres...
Mark Gabel, Zhendong Su
ATAL
2007
Springer
16 years 27 days ago
Approximate and online multi-issue negotiation
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
PODC
2010
ACM
15 years 10 months ago
Constant RMR solutions to reader writer synchronization
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...
Vibhor Bhatt, Prasad Jayanti
CSL
2009
Springer
15 years 10 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe
GI
2009
Springer
15 years 10 months ago
An Eclipse Framework for Rapid Development of Rich-featured GEF Editors based on EMF Models
Abstract: Model-based development has an increasing importance in modern software engineering and other domains. Visual models such as Petri nets and UML diagrams proved to be an a...
Tony Modica, Enrico Biermann, Claudia Ermel