Sciweavers

1798 search results - page 238 / 360
» A Tree for All Seasons
Sort
View
ISCAS
2005
IEEE
129views Hardware» more  ISCAS 2005»
14 years 3 months ago
Partitioning graphs of supply and demand
: Assume that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive integer, called a supply or a demand. Each demand vertex can receive ...
Takehiro Ito, Xiao Zhou, Takao Nishizeki
XIMEP
2005
ACM
150views Database» more  XIMEP 2005»
14 years 3 months ago
Updating the Pre/Post Plane in MonetDB/XQuery
We outline an efficient ACID-compliant mechanism for structural inserts and deletes in relational XML document storage that uses a region based pre/size/level encoding (equivalent...
Peter A. Boncz, Stefan Manegold, Jan Rittinger
BIOADIT
2004
Springer
14 years 3 months ago
Searching for a Practical Evidence of the No Free Lunch Theorems
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...
Mihai Oltean
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
14 years 3 months ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara
ACG
2003
Springer
14 years 2 months ago
Monte-Carlo Go Developments
We describe two Go programs,  ¢¡¤£¦¥ and  ¢¡¤§¨£ , developed by a Monte-Carlo approach that is simpler than Bruegmann’s (1993) approach. Our method is based on Abra...
Bruno Bouzy, Bernard Helmstetter