Sciweavers

4047 search results - page 298 / 810
» The Discrete Basis Problem
Sort
View
COMPGEOM
2005
ACM
15 years 6 months ago
Star splaying: an algorithm for repairing delaunay triangulations and convex hulls
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
Jonathan Richard Shewchuk
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
15 years 5 months ago
The study for transportation planning considered the inventory using hybrid genetic algorithm
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
Shinichiro Ataka, Mitsuo Gen
AAECC
2005
Springer
99views Algorithms» more  AAECC 2005»
15 years 4 months ago
Formulae for Arithmetic on Genus 2 Hyperelliptic Curves
The ideal class group of hyperelliptic curves can be used in cryptosystems based on the discrete logarithm problem. In this article we present explicit formulae to perform the gro...
Tanja Lange
AUTOMATICA
2005
93views more  AUTOMATICA 2005»
15 years 4 months ago
Steady-state performance evaluation of continuous mono-T-semiflow Petri nets
The number of states in discrete event systems can increase exponentially with respect to the size of the system. A way to face this state explosion problem consists of relaxing t...
Jorge Júlvez, Laura Recalde, Manuel Silva
TIT
2008
127views more  TIT 2008»
15 years 4 months ago
Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
Abstract--Max-product "belief propagation" (BP) is an iterative, message-passing algorithm for finding the maximum a posteriori (MAP) assignment of a discrete probability...
Mohsen Bayati, Devavrat Shah, Mayank Sharma