Sciweavers

284 search results - page 35 / 57
» On Some Polyhedra Covering Problems
Sort
View
ESA
2006
Springer
111views Algorithms» more  ESA 2006»
14 years 16 days ago
Path Hitting in Acyclic Graphs
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
Ojas Parekh, Danny Segev
JCP
2008
117views more  JCP 2008»
13 years 8 months ago
Selfish Constraint Satisfaction Genetic Algorithm for Planning a Long-distance Transportation Network
To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints...
Takashi Onoyama, Takuya Maekawa, Yoshitaka Sakurai...
ESWA
2002
177views more  ESWA 2002»
13 years 8 months ago
Expert systems in finance - a cross-section of the field
- This paper surveys a number of well-known expert systems in the domain of finance. The idea is to illustrate the span of typical expert systems in finance and to provide an insig...
Ljubica Nedovic, Vladan Devedzic
TSMC
2002
91views more  TSMC 2002»
13 years 8 months ago
On the sure criticality of tasks in activity networks with imprecise durations
Abstract--The notion of the necessary criticality (both with respect to path and to activity) of a network with imprecisely defined (by means of intervals or fuzzy intervals) activ...
Stefan Chanas, Didier Dubois, Pawel Zielinski
ICRA
2010
IEEE
130views Robotics» more  ICRA 2010»
13 years 7 months ago
Multi-robot coordination with periodic connectivity
Abstract— We consider the problem of multi-robot coordination subject to constraints on the configuration. Specifically, we examine the case in which a mobile network of robots...
Geoffrey Hollinger, Sanjiv Singh