Sciweavers

2880 search results - page 497 / 576
» Types are calling conventions
Sort
View
AGENTS
2000
Springer
15 years 10 months ago
Automated assistants to aid humans in understanding team behaviors
Multi-agent teamwork is critical in a large number of agent applications, including training, education, virtual enterprises and collective robotics. Tools that can help humans an...
Taylor Raines, Milind Tambe, Stacy Marsella
CRYPTO
2000
Springer
110views Cryptology» more  CRYPTO 2000»
15 years 10 months ago
Parallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
Yevgeniy Dodis, Silvio Micali
KDD
1998
ACM
141views Data Mining» more  KDD 1998»
15 years 10 months ago
Rule Discovery from Time Series
We consider the problem of nding rules relating patterns in a time series to other patterns in that series, or patterns in one series to patterns in another series. A simple examp...
Gautam Das, King-Ip Lin, Heikki Mannila, Gopal Ren...
TAGT
1994
Springer
185views Graph Theory» more  TAGT 1994»
15 years 10 months ago
Concatenation of Graphs
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
Joost Engelfriet, Jan Joris Vereijken
ERSHOV
2009
Springer
15 years 10 months ago
Anti-unification Algorithms and Their Applications in Program Analysis
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
Peter E. Bulychev, Egor V. Kostylev, Vladimir A. Z...