Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Abstract. This paper reports about the workshop Model Driven Development of Advanced User Interfaces (MDDAUI) which was held on October 2nd, 2005 at the MoDELS/UML 2005 conference ...
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
In the past, the creators of numerical programs had to choose between simple expression of mathematical formulas and static type checking. While the Lisp family and its dynamically...
Vincent St-Amour, Sam Tobin-Hochstadt, Matthew Fla...