Sciweavers

3653 search results - page 230 / 731
» On Recognizable Timed Languages
Sort
View
CP
2007
Springer
16 years 1 months ago
Bound-Consistent Deviation Constraint
Deviation is a recent constraint to balance a set of variables with respect to a given mean. We show that the propagators recently introduced are not bound-consistent when the mean...
Pierre Schaus, Yves Deville, Pierre Dupont
CP
2005
Springer
16 years 23 days ago
Computing and Exploiting Tree-Decompositions for Solving Constraint Networks
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...
ICALP
2005
Springer
16 years 22 days ago
Optimal In-place Sorting of Vectors and Records
Abstract. We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm...
Gianni Franceschini, Roberto Grossi
PLDI
2005
ACM
16 years 23 days ago
Programming ad-hoc networks of mobile and resource-constrained devices
Ad-hoc networks of mobile devices such as smart phones and PDAs represent a new and exciting distributed system architecture. Building distributed applications on such an architec...
Yang Ni, Ulrich Kremer, Adrian Stere, Liviu Iftode
CIKM
2011
Springer
14 years 7 months ago
An efficient method for using machine translation technologies in cross-language patent search
Topics in prior-art patent search are typically full patent applications and relevant items are patents often taken from sources in different languages. Cross language patent retr...
Walid Magdy, Gareth J. F. Jones