Sciweavers

11160 search results - page 400 / 2232
» Incompleteness in a General Setting
Sort
View
ENTCS
2002
121views more  ENTCS 2002»
15 years 6 months ago
Modal Predicates and Co-equations
We show how coalgebras can be presented by operations and equations. This is a special case of Linton's approach to algebras over a general base category X, namely where X is...
Alexander Kurz, Jirí Rosický
226
Voted
DALT
2005
Springer
16 years 12 days ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
AWCC
2004
Springer
16 years 8 days ago
Rule Discovery with Particle Swarm Optimization
Abstract. This paper proposes Particle Swarm Optimization (PSO) algorithm to discover classification rules. The potential IF-THEN rules are encoded into real-valued particles that...
Yu Liu, Qin Zheng, Zhewen Shi, Junying Chen
ATVA
2010
Springer
125views Hardware» more  ATVA 2010»
15 years 8 months ago
Using Redundant Constraints for Refinement
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
Eugene Asarin, Thao Dang, Oded Maler, Romain Testy...
ICPR
2008
IEEE
16 years 1 months ago
RANSAC-SVM for large-scale datasets
Support Vector Machines (SVMs), though accurate, are still difficult to solve large-scale applications, due to the computational and storage requirement. To relieve this problem,...
Kenji Watanabe, Takio Kurita