Sciweavers

1557 search results - page 158 / 312
» Programming up to Congruence
Sort
View
IPCO
2008
221views Optimization» more  IPCO 2008»
15 years 26 days ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
91
Voted
AOIS
2004
15 years 25 days ago
Agents as Catalysts for Mobile Computing
Agent-Oriented Programming (AOP) offers an alternative and radical approach to the development of information systems in various domains. However, one domain that AOP has only mini...
Gregory M. P. O'Hare, Michael J. O'Grady, Rem W. C...
DGO
2003
86views Education» more  DGO 2003»
15 years 24 days ago
The role of a search agent for disenfranchised users
Connected Kids project is about developing a searchable database system for the disenfranchised people of the city of Troy, New York. The various events and programs for the young...
Mousumi Chatterjee, Sibel Adali
84
Voted
AAAI
2000
15 years 24 days ago
Visual Event Classification via Force Dynamics
This paper presents an implemented system, called LEONARD, that classifies simple spatial motion events, such as pick up and put down, from video input. Unlike previous systems th...
Jeffrey Mark Siskind
AAAI
1994
15 years 23 days ago
Small is Beautiful: A Brute-Force Approach to Learning First-Order Formulas
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
Steven Minton, Ian Underwood