Sciweavers

1124 search results - page 191 / 225
» Mobile robot programming using natural language
Sort
View
ICALP
2011
Springer
12 years 11 months ago
On Tree-Constrained Matchings and Generalizations
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...
CHI
2009
ACM
14 years 8 months ago
QUICKIES: the future of sticky notes
In this paper, we present `QUICKIES', an attempt to bring one of the most useful inventions of the 20th century into the digital age: the ubiquitous sticky notes. `QUICKIES&#...
Pranav Mistry
WSC
2008
13 years 10 months ago
A Pi-calculus formalism for discrete event simulation
This paper presents PiDES, a formalism for discrete event simulation based on Pi-calculus. PiDES provides a rigorous semantics of behavior modeling and coordination for simulation...
Jianrui Wang, Richard A. Wysk
ESOP
2009
Springer
14 years 2 months ago
All Secrets Great and Small
Tools for analysing secure information flow are almost exclusively based on ideas going back to Denning’s work from the 70’s. This approach embodies an imperfect notion of sec...
Delphine Demange, David Sands
WFLP
2009
Springer
277views Algorithms» more  WFLP 2009»
14 years 2 months ago
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
Stephan Falke, Deepak Kapur