249 search results - page 32 / 50 » One Complexity Theorist's View of Quantum Computing |
COLT
2003
Springer
15 years 2 months ago
2003
Springer
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
CIDM
2007
IEEE
15 years 1 months ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
ENTCS
2007
14 years 9 months ago
2007
The timed concurrent constraint programming language (tccp in short) was introduced for modeling reactive systems. This language allows one to model in a very intuitive way typica...
SG
2005
Springer
15 years 3 months ago
2005
Springer
Parametric design systems model a design as a constrained collection of schemata. Designers work in such systems at two levels: definition of schemata and constraints; and search w...
68
Voted
MSV
2004
14 years 11 months ago
2004
Valid models are central to the existence of Computer science as in most other disciplines, but at what point can one say that a model is valid and hence correct? is often taken t...