Sciweavers

382 search results - page 23 / 77
» Reasoning about the Elementary Functions of Complex Analysis
Sort
View
IJCAI
2003
13 years 8 months ago
Case-Based Recommender Systems: A Unifying View
Abstract. This paper presents a unifying framework to model casebased reasoning recommender systems (CBR-RSs). CBR-RSs have complex architectures and specialize the CBR problem sol...
Fabiana Lorenzi, Francesco Ricci
SIGECOM
2011
ACM
229views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
A revealed preference approach to computational complexity in economics
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
Federico Echenique, Daniel Golovin, Adam Wierman
GECCO
2000
Springer
138views Optimization» more  GECCO 2000»
13 years 11 months ago
Time Complexity of genetic algorithms on exponentially scaled problems
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
Fernando G. Lobo, David E. Goldberg, Martin Pelika...
HYBRID
2000
Springer
13 years 11 months ago
Towards Procedures for Systematically Deriving Hybrid Models of Complex Systems
Abstract. In many cases, complex system behaviors are naturally modeled as nonlinear differential equations. However, these equations are often hard to analyze because of "sti...
Pieter J. Mosterman, Gautam Biswas
CCS
2008
ACM
13 years 9 months ago
Verifiable functional purity in java
Proving that particular methods within a code base are functionally pure--deterministic and side-effect free--would aid verification of security properties including function inve...
Matthew Finifter, Adrian Mettler, Naveen Sastry, D...