Differential reformulations of field theories are often used for explicit computations. We derive a one-matrix differential formulation two-matrix models, with the help which it is possible to diagonalize one- and models using formula by Itzykson Zuber that allows diagonalizing operators respect matrix elements Hermitian matrices. detail equivalence between expressions obtained partition functi...

This paper presents a genetic relevance optimisation process performed in an information retrieval system. The process uses genetic techniques for solving multimodal problems (niching) and query reformulation techniques commonly used in information retrieval. The niching technique allows the process to reach different relevance regions of the document space. Query reformulation techniques repre...

ion, Reformulation, and Approximation (SARA-2002) was held from 2 to 4 August 2002 in Kananaskis, Alberta, Canada. This interdisciplinary conference brought together researchers from around the world to present recent progress on, and exchange ideas about, how abstraction, reformulation, and approximation techniques can be used in areas such as automatic programming, constraint satisfaction, de...

Automated planning is a well studied research topic thanks to its wide range of real-world applications. Despite significant progress in this area many planning problems still remain hard and challenging. Some techniques such as learning macro-operators improve the planning process by reformulating the (original) planning problem. While many encouraging practical results have been derived from ...

We consider a class of generalized Nash equilibrium problems (GNEPs) where both the objective functions and the constraints are allowed to depend on the decision variables of the other players. It is well-known that this problem can be reformulated as a constrained optimization problem via the (regularized) Nikaido-Isoda-function, but this reformulation is usually nonsmooth. Here we observe tha...

In this article, we aim to find the most effective reformulation techniques to solve the MPCC (mathematical program with complementarity constraints) model that we proposed recently for continuous network design problems under asymmetric user equilibria. The MPCC model is based on a link-node nonlinear complementarity formulation for asymmetric user equilibria. By applying various reformulation...

Intelligent assistants (IAs) such as Siri and Cortana conversationally interact with users and execute a wide range of actions (e.g., searching the Web, setting alarms, and chatting). IAs can support these actions through the combination of various components such as automatic speech recognition, natural language understanding, and language generation. However, the complexity of these component...

Constraint validation has bcc?n difficult to implement efficiently. The major reason for this difficulty lies in the state-dependent nature of integrity constraints and the rt~quiremcnt of both high-level spc&fication and cfficirnt runtimc cnforccmcnt. In this paper, we propose a constraint reformulation approach to rfficicnt constraint validation. We also demonstrate how this knowledge-basrd c...