Sciweavers

7988 search results - page 1087 / 1598
» A Useful Undecidable Theory
Sort
View
PPDP
2004
Springer
16 years 16 days ago
Nominal rewriting systems
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...
Maribel Fernández, Murdoch Gabbay, Ian Mack...
RSCTC
2004
Springer
164views Fuzzy Logic» more  RSCTC 2004»
16 years 16 days ago
Rough Set Methodology in Clinical Practice: Controlled Hospital Trial of the MET System
Abstract. Acute abdominal pain in childhood is a common but diagnostically challenging problem facing Emergency Department personnel. Experienced physicians use a combination of ke...
Ken Farion, Wojtek Michalowski, Roman Slowinski, S...
CHI
2010
ACM
16 years 15 days ago
Motivations to participate in online communities
A consistent theoretical and practical challenge in the design of socio-technical systems is that of motivating users to participate in and contribute to them. This study examines...
Cliff Lampe, Rick Wash, Alcides Velasquez, Elif Oz...
CODES
2003
IEEE
16 years 14 days ago
Schedule-aware performance estimation of communication architecture for efficient design space exploration
In this paper, we are concerned about the performance estimation of bus-based architectures assuming that the task partitioning on the processing components is already determined....
Sungchan Kim, Chaeseok Im, Soonhoi Ha
GLVLSI
2003
IEEE
135views VLSI» more  GLVLSI 2003»
16 years 14 days ago
Constructing exact octagonal steiner minimal trees
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
Chris Coulston
« Prev « First page 1087 / 1598 Last » Next »