Sciweavers

949 search results - page 152 / 190
» Theory of Constraints
Sort
View
108
Voted
ICFP
2010
ACM
15 years 1 months ago
Parametricity and dependent types
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
Jean-Philippe Bernardy, Patrik Jansson, Ross Pater...
111
Voted
ICML
2010
IEEE
15 years 1 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
109
Voted
ATAL
2010
Springer
15 years 22 days ago
Verifying agents with memory is harder than it seemed
ATL+ is a variant of alternating-time temporal logic that does not have the expressive power of full ATL , but still allows for expressing some natural properties of agents. It ha...
Nils Bulling, Wojciech Jamroga
101
Voted
CCR
2010
156views more  CCR 2010»
15 years 19 days ago
Evolvable network architectures: what can we learn from biology?
There is significant research interest recently to understand the evolution of the current Internet, as well as to design clean-slate Future Internet architectures. Clearly, even ...
Constantine Dovrolis, J. Todd Streelman
108
Voted
CORR
2010
Springer
154views Education» more  CORR 2010»
15 years 19 days ago
Algorithmic Thermodynamics
Algorithmic entropy can be seen as a special case of entropy as studied in statistical mechanics. This viewpoint allows us to apply many techniques developed for use in thermodyna...
John C. Baez, Mike Stay