Sciweavers

7430 search results - page 1059 / 1486
» Programming Applications in CIFF
Sort
View
CP
2007
Springer
16 years 1 months ago
Boosting Probabilistic Choice Operators
Probabilistic Choice Operators (PCOs) are convenient tools to model uncertainty in CP. They are useful to implement randomized algorithms and stochastic processes in the concurrent...
Matthieu Petit, Arnaud Gotlieb
FOSSACS
2007
Springer
16 years 1 months ago
Complexity Results on Balanced Context-Free Languages
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
Akihiko Tozawa, Yasuhiko Minamide
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
16 years 1 months ago
Comparison of tree and graph encodings as function of problem complexity
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
Michael D. Schmidt, Hod Lipson
ICALP
2007
Springer
16 years 1 months ago
Unbounded-Error One-Way Classical and Quantum Communication Complexity
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Sh...
IFIP
2007
Springer
16 years 29 days ago
Towards UML-Intensive Framework for Model-Driven Development
The paper describes a conceptual framework for model-driven development based on concise application of UML and modeling tool functionality. A case study of modeling software for l...
Darius Silingas, Ruslanas Vitiutinas
« Prev « First page 1059 / 1486 Last » Next »