Sciweavers

834 search results - page 27 / 167
» A Decomposition Technique for Max-CSP
Sort
View
COMPGEOM
1995
ACM
15 years 1 months ago
A New Technique for Analyzing Substructures in Arrangements
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
Boaz Tagansky
JSA
2000
96views more  JSA 2000»
14 years 9 months ago
Design techniques for low-power systems
Portable products are being used increasingly. Because these systems are battery powered, reducing power consumption is vital. In this report we give the properties of low power d...
Paul J. M. Havinga, Gerard J. M. Smit
VLDB
1998
ACM
141views Database» more  VLDB 1998»
15 years 1 months ago
Bulk-Loading Techniques for Object Databases and an Application to Relational Data
We present a framework for designing, in a declarative and flexible way, efficient migration programs and an undergoing implementation of a migration tool called RelOO whose targe...
Sihem Amer-Yahia, Sophie Cluet, Claude Delobel
EAAI
2007
90views more  EAAI 2007»
14 years 9 months ago
AI techniques in modelling, assignment, problem solving and optimization
This paper recapitulates the results of a long research on a family of artificial intelligence (AI) methods—relying on, e.g., artificial neural networks and search techniques...
Zsolt János Viharos, Zsolt Kemény
CICLING
2012
Springer
13 years 5 months ago
Core-Periphery Organization of Graphemes in Written Sequences: Decreasing Positional Rigidity with Increasing Core Order
The positional rigidity of graphemes (as well as words considered as single units) in written sequences has been analyzed in this paper using complex network methodology. In partic...
Md. Izhar Ashraf, Sitabhra Sinha