Sciweavers

212 search results - page 31 / 43
» Working with Mathematical Structures in Type Theory
Sort
View
133
Voted
ATAL
2007
Springer
15 years 9 months ago
Goals in the context of BDI plan failure and planning
We develop a Belief-Desire-Intention (BDI) style agent-oriented programming language with special emphasis on the semantics of goals in the presence of the typical BDI failure han...
Sebastian Sardiña, Lin Padgham
255
Voted
POPL
2004
ACM
16 years 3 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
142
Voted
CIKM
2008
Springer
15 years 5 months ago
On low dimensional random projections and similarity search
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
Yu-En Lu, Pietro Liò, Steven Hand
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
16 years 3 months ago
On the fourier tails of bounded functions over the discrete cube
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Don...
SPAA
2009
ACM
15 years 10 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn