Sciweavers

1686 search results - page 170 / 338
» Programs as polygraphs: computability and complexity
Sort
View
LICS
1989
IEEE
15 years 7 months ago
Elf: A Language for Logic Definition and Verified Metaprogramming
We describe Elf, a metalanguage for proof manipulation environments that are independent of any particular logical system. Elf is intended for meta-programs such as theorem prover...
Frank Pfenning
129
Voted
DATESO
2006
106views Database» more  DATESO 2006»
15 years 5 months ago
GeKon - Applying Novel Approaches to GIS Development
Abstract. This paper describes a few ideas concerned with geographical information systems (GIS) development. Those ideas come from a GIS development project named GeKon, which is ...
Tomas Richta
134
Voted
ICML
2010
IEEE
15 years 4 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
143
Voted
CCE
2004
15 years 3 months ago
Stochastic maximum principle for optimal control under uncertainty
Optimal control problems involve the difficult task of determining time-varying profiles through dynamic optimization. Such problems become even more complex in practical situatio...
Vicente Rico-Ramírez, Urmila M. Diwekar
CPHYSICS
2007
71views more  CPHYSICS 2007»
15 years 3 months ago
Simulation of n-qubit quantum systems. III. Quantum operations
During the last decade, several quantum information protocols, such as quantum key distribution, teleportation or quantum computation, have attracted a lot of interest. Despite th...
T. Radtke, S. Fritzsche