Sciweavers

3572 search results - page 411 / 715
» Nominal Logic Programming
Sort
View
ICFP
2002
ACM
16 years 6 months ago
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
Benjamin Grégoire, Xavier Leroy
196
Voted
ARGMAS
2004
Springer
15 years 11 months ago
An Argument-Based Framework to Model an Agent's Beliefs in a Dynamic Environment
Abstract. One of the most difficult problems in multiagent systems involves representing knowledge and beliefs of agents in dynamic environments. New perceptions modify an agent’...
Marcela Capobianco, Carlos Iván Chesñ...
CIDR
2011
230views Algorithms» more  CIDR 2011»
14 years 9 months ago
Consistency Analysis in Bloom: a CALM and Collected Approach
Distributed programming has become a topic of widespread interest, and many programmers now wrestle with tradeoffs between data consistency, availability and latency. Distributed...
Peter Alvaro, Neil Conway, Joe Hellerstein, Willia...
167
Voted
SIGUCCS
2005
ACM
15 years 11 months ago
Developing a synchronous web seminar application for online learning
Many higher education institutions are searching for cost effective tools for the delivery of a feature rich, synchronous online learning environment. While there are several comm...
Michael D. Ciocco, Neil Toporski, Michael Dorris
INFOCOM
1989
IEEE
15 years 9 months ago
An Efficient Multiple-Access Method for the Binary Adder Channel
Consider M - HChoose P - T communications: T users or less, out of M potential users, are chosen at random to simultaneously transmit binary data over a common channel. A method f...
Israel Bar-David, Eli Plotnik, Raphael Rom