Sciweavers

12774 search results - page 119 / 2555
» A Framework for Proof Systems
Sort
View
TABLEAUX
2009
Springer
15 years 10 months ago
Generic Modal Cut Elimination Applied to Conditional Logics
We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the ...
Dirk Pattinson, Lutz Schröder
GECCO
2003
Springer
100views Optimization» more  GECCO 2003»
15 years 9 months ago
Dense and Switched Modular Primitives for Bond Graph Model Design
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...
Kisung Seo, Zhun Fan, Jianjun Hu, Erik D. Goodman,...
SERP
2007
15 years 5 months ago
AppDetector: A Tool Prototype for Visualizing Java Code Dependencies on Relational Databases
- Modern tools have simplified the development of the enterprise applications by bridging gaps across various technologies like file systems, relational databases, messaging, and w...
Sai Ravindran, Paul L. Bergstein
TSP
2008
144views more  TSP 2008»
15 years 4 months ago
A New Robust Variable Step-Size NLMS Algorithm
A new framework for designing robust adaptive filters is introduced. It is based on the optimization of a certain cost function subject to a time-dependent constraint on the norm o...
Leonardo Rey Vega, Hernan Rey, Jacob Benesty, Sara...
APWEB
2007
Springer
15 years 10 months ago
Coexistence Proof Using Chain of Timestamps for Multiple RFID Tags
How can a RFID (Radio Frequency Identification Devices) system prove that two or more RFID tags are in the same location? Previous researchers have proposed yoking-proof and groupi...
Chih-Chung Lin, Yuan-Cheng Lai, J. D. Tygar, Chuan...