Sciweavers

3134 search results - page 377 / 627
» Computing full disjunctions
Sort
View
105
Voted
RAS
2002
105views more  RAS 2002»
15 years 11 days ago
Visually guided manipulation tasks
In this paper, we present a framework for a robotic system with the ability to perform real-world manipulation tasks. The complexity of such tasks determines the precision and fre...
Danica Kragic, Lars Petersson, Henrik I. Christens...
TNN
1998
85views more  TNN 1998»
15 years 11 days ago
Fast numerical integration of relaxation oscillator networks based on singular limit solutions
—Relaxation oscillations exhibiting more than one time scale arise naturally from many physical systems. When relaxation oscillators are coupled in a way that resembles chemical ...
P. S. Linsay, DeLiang L. Wang
87
Voted
TODAES
1998
68views more  TODAES 1998»
15 years 11 days ago
Specification and verification of pipelining in the ARM2 RISC microprocessor
Abstract State Machines (ASMs) provide a sound mathematical basis for the specification and verification of systems. An application of the ASM methodology to the verification of a ...
James K. Huggins, David Van Campenhout
INFOCOM
2010
IEEE
14 years 11 months ago
Distributed Resource Allocation for Synchronous Fork and Join Processing Networks
—Many emerging information processing applications require applying various fork and join type operations such as correlation, aggregation, and encoding/decoding to data streams ...
Haiquan (Chuck) Zhao, Cathy H. Xia, Zhen Liu, Dona...
132
Voted
JELIA
2010
Springer
14 years 11 months ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...