Sciweavers

748 search results - page 30 / 150
» Mechanism design for abstract argumentation
Sort
View
IWOCA
2009
Springer
152views Algorithms» more  IWOCA 2009»
14 years 4 months ago
Better Polynomial Algorithms on Graphs of Bounded Rank-Width
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
Robert Ganian, Petr Hlinený
UML
2005
Springer
14 years 3 months ago
Domain Models Are Aspect Free
Abstract. Proponents of aspect orientation have successfully seeded the impression that aspects—like objects—are so fundamental a notion that they should pervade all phases and...
Friedrich Steimann
POPL
1997
ACM
14 years 2 months ago
First-class Polymorphism with Type Inference
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
Mark P. Jones
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 6 months ago
Argudas: arguing with gene expression information
Abstract. In situ hybridisation gene expression information helps biologists identify where a gene is expressed. However, the databases that republish the experimental information ...
Kenneth McLeod, Gus Ferguson, Albert Burger
CL
1999
Springer
13 years 9 months ago
Compositional Petri net models of advanced tasking in Ada-95
Abstract The Ada language has been designed to support development of concurrent and distributed software. While the Ada83 standard defined the basic mechanisms of rendezvous-based...
Ravi K. Gedela, Sol M. Shatz, Haiping Xu