Sciweavers

887 search results - page 4 / 178
» Locally definable homotopy
Sort
View
CONSTRAINTS
2008
138views more  CONSTRAINTS 2008»
13 years 9 months ago
Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
Martin C. Cooper
EGOV
2003
Springer
14 years 2 months ago
A Methodological Approach for Defining One-Stop e-Government Service Offerings
Abstract. In the CB-BUSINESS project (IST-2001-33147, http://www.cbbusiness.com/), a number of administrative services from public agencies and professional chambers in different c...
Dimitris Gouscos, Maria A. Lambrou, Gregoris Mentz...
ORDER
2006
128views more  ORDER 2006»
13 years 9 months ago
Algebras Defined from Ordered Sets and the Varieties they Generate
We investigate ways of representing ordered sets as algebras and how the order relation is reflected in the algebraic properties of the variety (equational class) generated by the...
Joel Berman, Willem J. Blok
BSL
2000
153views more  BSL 2000»
13 years 9 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon