Sciweavers

1955 search results - page 38 / 391
» Can Computers Handle Adverbs
Sort
View
ATAL
2007
Springer
15 years 10 months ago
Intelligent agent framework for order entry and management
This paper describes an agent system we have built to handle order entry and management issue in business computing and specialized in the telecommunication domain. Our system is ...
Thuc Duong Nguyen, Simon Thompson
SC
1994
ACM
15 years 7 months ago
The range test: a dependence test for symbolic, non-linear expressions
Most current data dependence tests cannot handle loop bounds or array subscripts that are symbolic, nonlinear expressions e.g. Ani+j, where 0 j n. In this paper, we describe a d...
William Blume, Rudolf Eigenmann
159
Voted
TDSC
2011
14 years 10 months ago
Application-Level Diagnostic and Membership Protocols for Generic Time-Triggered Systems
Abstract— We present on-line tunable diagnostic and membership protocols for generic time-triggered (TT) systems to detect crashes, send/receive omission faults and network parti...
Marco Serafini, Péter Bokor, Neeraj Suri, J...
155
Voted
EC
1998
112views ECommerce» more  EC 1998»
15 years 3 months ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley
124
Voted
JMLR
2010
115views more  JMLR 2010»
14 years 10 months ago
Fast and Scalable Local Kernel Machines
A computationally efficient approach to local learning with kernel methods is presented. The Fast Local Kernel Support Vector Machine (FaLK-SVM) trains a set of local SVMs on redu...
Nicola Segata, Enrico Blanzieri