Sciweavers

555 search results - page 40 / 111
» Complexity of Operations on Cofinite Languages
Sort
View
APLAS
2010
ACM
13 years 7 months ago
Data Structure Fusion
We consider the problem of specifying data structures with complex sharing in a manner that is both declarative and results in provably correct code. In our approach, abstract data...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...
ACL
1998
13 years 9 months ago
Generating the Structure of Argument
This paper demonstrates that generating arguments in natural language requires at an abstract level, and that the ate abstraction cannot be captured by approaches based solely upo...
Chris Reed, Derek Long
TACS
2001
Springer
14 years 1 days ago
The UDP Calculus: Rigorous Semantics for Real Networking
Network programming is notoriously hard to understand: one has to deal with a variety of protocols (IP, ICMP, UDP, TCP etc), concurrency, packet loss, host failure, timeouts, the c...
Andrei Serjantov, Peter Sewell, Keith Wansbrough
ATAL
2003
Springer
14 years 25 days ago
A decision making procedure for collaborative planning
A team of agents planning to perform a complex task make a number of interrelated decisions as they determine precisely how that complex task will be performed. The decision set i...
Timothy W. Rauenbusch, Barbara J. Grosz
CJ
2010
114views more  CJ 2010»
13 years 7 months ago
Using the Relational Model to Capture Topological Information of Spaces
Abstract. Motivated by research on how topology may be a helpful foundation for building information modeling (BIM), a relational database version of the notions of chain complex a...
Patrick Erik Bradley, Norbert Paul